The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in…
GATE · 2016 · CS · Set 2 · Computer Science & IT
The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in an empty binary search tree, such that the resulting tree has height 6, is ____________ .
Note: The height of a tree with a single node is 0.
Attempted by 222 students.
Sign up free to check your answer
Sign up freeLoading lesson…