The number of ways in which the numbers 1, 2, 3, 4, 5, 6, 7 can be inserted in…

PYQ GATE 2016

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 252 students.

Sign up free to check your answer

Sign up free

Explore the full course: Zero To Hero

Loading lesson…