Question: Let us consider a Binary Search Tree, BST, of height H. In terms of H, the complexity in time (big-Oh notation) of the BST operations
Let us consider a Binary Search Tree, BST, of height H. In terms of H, the complexity in time (big-Oh notation) of the BST operations is as follows.
Select all that apply:
a. Printing BST using the in order traversal is in O(log H)
b. FindMax is in O(H)
c. FindMin is in O(H2)
d. Printing BST using the pre order traversal is in O(log(logH))
e. Delete of a leaf node is in O(H)
f. Delete of a one child node is in O(H)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
