Tree structure

During the course, we discussed four types of trees for implementing a symbol table:

2. Give three types of binary search trees.
4. What are the bounds on the length of every path from the root node to a leaf node in a 2-3 tree containing n keys?
6. Starting from the root of a binary search tree, describe the path followed to find the node with the minimum key.
8. Starting from the root of a binary search tree, describe the path followed to find the node with the maximum key.
10. In a full binary search tree, describe the path followed to find the node with the second smallest key, that is, the key that is greater than the minimum key but less than all of the other keys.
12. In a full binary search tree, describe the path followed to find the node with the second largest key, that is, the key that is less than the maximum key but greater than all of the other keys.

Answer rating: 100% (QA)

1 Binary search tree BST 23 tree Redblack tree AVL tree 2 Three types of binary search trees are Bal... View the full answer