MCQOPTIONS
Saved Bookmarks
| 1. |
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 treewww. |
| D. | All of the above |
| Answer» E. | |