0
1
2
No Limit
Randomized traversal
Preorder traversal
Postorder traversal
Inorder traversal
The value of the left child should be less than the root node
The value of the right child should be greater than the root node.
The left and right sub trees should also be a binary search tree
None of the above
A tree which is binary search tree and height balanced tree.
A tree which is a binary search tree but unbalanced tree.
A tree with utmost two children
A tree with utmost three children
AVL tree
B-tree
B+ - tree
Splay tree
Queue
Stack
Tree
Linked List
