2-3 Tree
1. How many children can a node in a binary tree have?
2. Node values in a binary tree are sorted, i.e., values smaller than root are on the left side of root and values greater than root are on the right side of root?
3. The worst case height of a Binary Search Tree with ‘n’ nodes is:
4. The inorder traversal in a binary search tree signifies traversing:
5. A binary tree is the optimal data structure for implementing Undo/Redo operations.