Saved Bookmarks
| 1. |
How many distinct binary search trees can be formed which contains the integers 1, 2, 3?(A) 6(B) 5(C) 4(D) 3 |
|
Answer» Correct option - (B) 5 |
|