MCQOPTIONS
Saved Bookmarks
| 1. |
What is the longest length path for a node x in random binary search tree for the insertion process? |
| A. | log x |
| B. | x2 |
| C. | x! |
| D. | 4.311 log x |
| Answer» D. 4.311 log x | |