Directions: Answer each of the following questions. Please ensure that your responses are at least 3 to 5 sentences in length.
1. What are the three general categories of data management operations?
2. List three position-oriented ADTs.
3. Define the root of a tree.
4. Define a leaf of a tree.
5. What is a subtree?
6. What are the characteristics of a binary tree?
7. Define the left child of node n in a binary tree.
8. What are the three properties of each node n in a binary search tree?
9. In what order does a preorder traversal visit a node and its subtrees?
10. In what order does an inorder traversal visit a node and its subtrees?
11. In what order does a postorder traversal visit a node and its subtrees?
12. In an array-based representation of a binary tree, what is the purpose of a free list?
13. What is a search key?
14. Define an n-ary tree.
15. Describe the STL functions lower_bound and upper_bound.