Question

8. A binary search tree is a binary tree : (a) all items in the left subtree are less than root (b) all items in the right subtree are greater than or equal to the root (c) each subtree is itself a binary search tree (d) all of the above

Answer 1

Answer:

A 5-ary tree in which every internal node has. The number of left nodes in such a tree with 8 internal nodes will be: • 30

Answer 2

(d) all of the above is the correct answer.

A binary search tree is a binary tree in which:

• All items in the left subtree are less than root.

Hence, option A is correct.

• All items in the right subtree are greater than or equal to the root.

Hence, option B is correct.

• Each subtree is itself a binary search tree.

Hence, option C is correct.

As, all options are correct, option(d) all of the above is the correct answer.

#SPJ3