Multiple choice

Which of the following statements is not correct about binary search tree?

  1. Values of in the left subtree are less than root.

  2. Values of in the right subtree are greater than or equal to the root.

  3. Each subtree is itself a binary search tree.

  4. They do not have a recursively defined data structure.

  5. The nodes at the lowest levels of the tree are known as leaves.
Reveal answer Fill a bubble to check yourself
D Correct answer
Explanation

This is the wrong answer since they have a recursively defined data structure.

Keep practicing — related questions