GATE Computer Science (CS) 2016 Shift 2 Solved Paper

Question : 50 of 65

Marks: +1, -0

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.