A binary search tree with the height ‘h’ can have a maximum of 2 (h + 1) - 1 nodes. B. The height of a binary search tree containing ‘n’ elements can be at most (n-1). C. The time complexity for inserting a new element into a BST tree that contains 'n' elements is in the worst case 0 (log2 n). D. The time complexity for inserting a new element into an AVL tree that contains 'n' elements is at best 0 (log2 n). E. The complexity of the time to insert a new element into a red-black tree containing 'n' elements is in the worst case 0 (log2 n). Group of answer options Only statements B and E are correct. Only statements A, B and E are correct. Only statements B, D and E are correct. Only statements A, B, D and E are correct. Only statements B, C and E are correct.
Below are some statements about binary search trees and red-black trees. Indicate which of these statements is correct.
A. A binary search tree with the height ‘h’ can have a maximum of 2 (h + 1) - 1 nodes.
B. The height of a binary search tree containing ‘n’ elements can be at most (n-1).
C. The time complexity for inserting a new element into a BST tree that contains 'n' elements is in the worst case 0 (log2 n).
D. The time complexity for inserting a new element into an AVL tree that contains 'n' elements is at best 0 (log2 n).
E. The complexity of the time to insert a new element into a red-black tree containing 'n' elements is in the worst case 0 (log2 n).
Group of answer options
Only statements B and E are correct.
Only statements A, B and E are correct.
Only statements B, D and E are correct.
Only statements A, B, D and E are correct.
Only statements B, C and E are correct.
Step by step
Solved in 2 steps with 2 images
