BST quiz
The worst case complexity of inserting a key to a BST is
constant time
logarithmic time
linear time
linearithmic time
quadratic time
Submit
Consider the BST given below. A level order traversal of the tree results in
A C E F H M P R S X Y
R E C A M H F P X S Y
R E X C M S Y A H P F
A C F H P M E S Y X R
Submit
The total memory required (in bytes) to store a BST node whose key is an integer is
24
20
16
8
Submit
Total number of BST's that can be created from 4 comparable keys is
5
14
4!
none of the above
Submit