Question $7$

Which of the following statements is$/$are true?

Pick ONE option

The only necessary and sufficient condition for a binary tree to be a binary search tree is that the inorder traversal of the binary tree should be sorted in non$-$decreasing order.

In comparison to a binary tree, insertion, deletion, and search operations take less time in a height$-$balanced tree.

Both A and B

None of these