Q36
How do you determine if a binary tree is a binary search tree?
A.
By checking if each node's left children are smaller and right children are larger.
AnswerB.
By ensuring the tree is balanced.
C.
By verifying that all nodes have two children.
D.
By checking the height of the tree.
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board