1. Consider a complete binary tree with exactly 10,000 nodes, implemented with an array. Suppose a node has its value stored in location 4999. Where is the value stored for this node’s parent? Where is the value stored for its left child? What can you say about its right child?
2. Draw a boxes-and-arrows representation of a small binary tree with three nodes containing integers. Put 10 in the root, 20 in the left child of the root, and 30 in the right child of the root.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here