Question

Balanced Trees

Identify the correctness of each of the following statements by marking either a T for true of F for false 1. (1 point)A balanced tree is exclusively defined as one in which the height of each sub-tree (or child) differs by no more than one (1). 2. (1 point)In a red-black tree, after rotating three nodes, the two children will each be red. 3. (1 point) One will only ever need to perform one rotation or color-flip in a red-black tree 4. (1 point) Both red-black and AVL trees produce keys in sorted order. 5. (1 point)Adding a single item to a hash table or AVL tree, both of size n requires a when balancing. complexity of O(log(n)) Balanced Trees 6. (2 points) Which data structure implements the Map interface by connecting a sequence of independent Node objects through reference pointers? A. Binary Heap B. Hash table C. Binary search tree D. Both B and C E. None of the above 6.

Answer 1

Q1

This is true

Q2

This is false as the children can be black as well

Q3

This is false as multiple rotations might be required

Q4

True as both are self balancing BST only

Q5

This is false. Hash will require O(1)

Q6

Hash Table implements map using reference pointers.

Do give a thumbs up