recategorized by
382 views

1 Answer

Related questions

1 votes
1 votes
2 answers
1
rajoramanoj asked Nov 6, 2017
859 views
0 votes
0 votes
1 answer
2
K ANKITH KUMAR asked Aug 29, 2018
1,819 views
Let T (n) be the number of comparisons needed in a binary search of a list of n elements. What is the recurrence relation? Explain. 1) T(n) = T(n/2) + 22) T(n) = T(n/2) +...
3 votes
3 votes
1 answer
3
iita asked Jan 19, 2017
3,243 views
The number of BST possible with 6 nodes numbered 1, 2, 3, 4, 5 and 6 with exactly one leaf node __________
0 votes
0 votes
1 answer
4
aditi19 asked Oct 1, 2018
623 views
what are the applications of optimal binary search tree?