Let's test your knowledge. Click the correct answer from the options.
Select the false statement about binary search trees.
Click the option that best answers the question.
- Every node has at least two children
- Left and right subtrees are also BSTs
- Inorder traversal traverses the BST in increasing order
- Left child is always lesser than the parent
