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.mcq
Answers
Answered by
0
hi there were no other reason I can't get it
Similar questions