You have to write a program which takes random input from the user. Based on the...

 

Transcribed Image Text:

You have to write a program which takes random input from the user. Based on the inputs given by the user, you have to create a linked list. Implement all the insert, delete, search and display operations. The linked list has two additional functions called getCount() and swap(int value ). The getCount() function count the number of nodes in the linked list and return the value. The swap (int value, int position) method takes a value and position number. This function finds out the value and swap its position with the value at first (if position is 0) or the value at last (if position is 1) of the linked list. Now consider this linked list as the input for a BST (Binary Search Tree). Each of the node of the linked list will be the input for the BST. Create a function to construct the BST by using the nodes of the linked list. Implement insert, delete, search and display operations of BST. Consider inorder traversal while displaying the elements of the BST. ** Any node that will be inserted into linked list, must have to inserted into BST also. [Use proper data structures, functions, object-oriented programming principles to implement and demonstrate the above scenario. You cannot use any standard template library. All the functions of the data structure must be implemented by you.] You have to write a program which takes random input from the user. Based on the inputs given by the user, you have to create a linked list. Implement all the insert, delete, search and display operations. The linked list has two additional functions called getCount() and swap(int value ). The getCount() function count the number of nodes in the linked list and return the value. The swap (int value, int position) method takes a value and position number. This function finds out the value and swap its position with the value at first (if position is 0) or the value at last (if position is 1) of the linked list. Now consider this linked list as the input for a BST (Binary Search Tree). Each of the node of the linked list will be the input for the BST. Create a function to construct the BST by using the nodes of the linked list. Implement insert, delete, search and display operations of BST. Consider inorder traversal while displaying the elements of the BST. ** Any node that will be inserted into linked list, must have to inserted into BST also. [Use proper data structures, functions, object-oriented programming principles to implement and demonstrate the above scenario. You cannot use any standard template library. All the functions of the data structure must be implemented by you.]