Statement 1: When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.
Statement 2: When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.
A. Statement 1 is true but statement 2 is false
B. Statement 2 is true but statement 1 is false
C. Both the statements are true
D. Both the statements are false
Answer: Option A
This Question Belongs to Data Structure >> Advanced Trees (AVL, RedBlack, BTrees)
What is the primary property of an AVL tree?
A. It allows duplicate keys.
B. It is a self-balancing binary search tree.
C. It maintains a fixed height.
D. It allows duplicate keys.
Which of the following operations is used to restore balance in an AVL tree after insertion?
A. Merging
B. Splaying
C. Rotations
D. Hashing
In a Red-Black tree, which property ensures that no two consecutive red nodes exist on any path?
A. Black property
B. Balance property
C. Height property
D. Red property
What is the maximum height of an AVL tree with n nodes?
A. log2(n + 1)
B. log2(n)
C. 2*log2(n)
D. log10(n)
Join The Discussion