s an explanation of the code and its working details completely. It must contain the pictures of each and every functions results. Write a menu driven program to implement the linked list that has the following operations: Insert(data) Search(key) Delete(key) Your Linked List must accommodate Trader type of data. A bloom filter that acts as a membership data structure giving a very quick heads up on search of an item. Data is key/value fields for a Trader type of data tradernumber is the key or identifying field and other data fields
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
Write a COMPLETE C++ code by using only #include<iostream> library,
Includes an explanation of the code and its working details completely. It must contain the pictures of each and every functions results.
Write a menu driven program to implement the linked list that has the following operations:
Insert(data)
Search(key)
Delete(key)
Your Linked List must accommodate Trader type of data.
A bloom filter that acts as a membership data structure giving a very quick heads up on search of an item.
Data is key/value fields for a Trader type of data
tradernumber is the key or identifying field and other data fields name and department are value fields. All these fields combine to form the data and for Search and Delete all we need from the user is the key field.
class LinkedList
{
(This class will only have the address of the first node in the List because if you have that you can reach any other node in the list by the next pointers in the node)
Node * head;
(The head is only a place to hold the address of a node it does not mean that there is space for a Node object that is created. Make sure to make a Node object on heap using new and then assign the address of this node to head pointer.)
The functions will be:
Insert(data)
Search(key)
Delete(key)
};
class Node
{
Trader t;
Node * next;
};
class Trader
{
char tradernumber[ ];
char name [ ];
char department[ ];
};
Step by step
Solved in 3 steps with 1 images
