1. Languages like Java do not have pointers. Design a pointerless Node that can support data structures like Linked Lists or BinaryTrees, and write the Insert function. Note: you CAN use pointers to create the nodes, but the Node cannot contain a pointer.
2. Given this tree subsection:
A
/
B E
/
C D
Show what it will look like after this "rotation" where 'A' is the parent:
Node* temp = parent->right;
parent->right = temp->left;
temp->left = parent;
3. Identify the search algorithm from the four algorithms shown below. For the data structures that have no matching search algorithm, write NONE.
1. Stack
2. Queue
3. Linked List
4. Doubly Linked List
5. Binary Search Tree
6. Graph Breadth First
7. Graph Depth First
8. Hashtable
9. Dictionary
4. Suppose you are writing a program to produce a book index. For example, the subject "Adjacency Matrix" is listed on pages: 805, 902, 910. Which data structure would be the best to use? Explain your answer in 50 words or less, and provide the "Insert" function pseudo-code. What will be the BigO for your insert?