C-Programming-data-structure || 2016 SET 2 || MCQ || 2-mark || Module 3: Tree | Graph | Hashing2

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.

[This question was originally a Fill-in-the-Blanks question] 2016 SET 2 || MCQ || 2-mark