Answer 4 Questions in C++

1. Languages like Java do not have pointers. Design a pointer-less 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. Each Node in a BinaryTree is stored at a 'level' in the Tree, based on its level "distance" from the Root Node. For example, the Root Node is level 0, and the Nodes immediately under the Root Node are at level 1. The Root, in this case, is the "Parent" of the nodes at level 1. The Nodes of the Nodes at level 2 are the parents of the Nodes at level 1. Write a function that determines the common Parent (or Grand Parent or Grand-Grand Parent, etc.) given two Nodes. 3. Graphs are similar to BinaryTrees, except each Node can have more than two branches. Write a function to cycle through all the nodes in a Graph. Note that it when going through the edges in a Graph it is possible to go into an infinite loop unless precautionary steps are taken. It may also be helpful to think recursively about the solution. 4. Most Hash based containers adapt sequential access containers to access data in BigO(1) time. Would it be possible to adapt a Linked List as the core container for a Hash based container? If yes, explain how you could Hash to a given node in BigO(1). If no, explain why it would take more than BigO(1) time to find a given node.