Question

Data structures C++

1-

 A balanced binary tree is a binary tree structure in which the left and right subtrees of every node differ in height by no more than 1

 Out of the following choices, which is the minimum set of nodes, if removed, will make the BST balanced?

2-

 Which of the following is true for Red-Black Trees ? Select all choices that apply!

 Select one or more:

 a. For each node in the tree, all paths from that node to any leaf nodes contain the same number of black

 nodes

 b. If a node is red, then both of its children must be black, but its parent should be red.

 C. Red-Black Tree is a self-balancing Binary Search Tree (BST)

 d. The root of tree is always red.

 e. Every node has either red or black color.

 f. Every leaf (NIL) node is black

3-

 It is possible to have a red-black tree with no red nodes.

 Select one:

 True

 False

Answer 1

1)  a.  {7}
2)


3)  True