9 (11 4 Answer the following questions from the above given binary tree: 1. Root: 2. Internal Nodes: 3. Leaf Nodes : 4. Ancestor of 11 : 5. Descendants of 5: 6. Children of 6: 7. Siblings of 7:

Which statement best represents the action taken when removing an element from a binary search tree that has a single child? A) replacing it with its only child B) comparing the element with the root node C simply deleting it replacing it with a duplicate parent element

1. Stack 2. Queue 3. Singly-linked list 4. Binary search tree 5. AVL tree 6. Priority queue 7. Hash table Can be used as an auxiliary data structure for expression evaluation with a binary tree.   Often implemented with complete binary trees satisfying a partial order property.   Data is not ordered, but insertion and search are expected to take O(1) time.   Data is fully ordered, insertion, removal and search are guaranteed to be less than O(n) time.