Register

binary search tree
closed

• closed by
452 views
0 votes
0 votes
closed with the note: Similar question to : https://gateoverflow.in/39586/gate-2016-2-40
the number of ways in which the numbers 11,12,13,14,15,16,17 can be inserted in an emty binary search tree , such that the resulting tree has height 6 is  ------------

NOTE : the height of a tree with single node is 0
• closed by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
someshawasthi asked Feb 27, 2023
473 views
binary search tree
Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 are traversed not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing value 4?
Consider a binary search tree, while searching the key value 4, key values 1, 2, 3, 6, 8, 9, 10 and 11 are traversed not necessarily in the order given. How many differen...
User Avatar
0 votes
0 votes
1 answer
2
`JEET asked Jan 19, 2019
476 views
Is there any good content available online for OPTIMAL BINARY SEARCH TREE? Preferably Videos.
Suggestions on good content for Optimal Binary Search Tree.
Suggestions on good content for Optimal Binary Search Tree.
User Avatar
Link Copied!