315 views

1 Answer

Related questions

0 votes
0 votes
1 answer
1
0 votes
0 votes
0 answers
2
Na462 asked Oct 20, 2018
590 views
Consider 4 labeled 1,2,3,4. The number of distinct binary tree possible such that whose inorder traversal is 1,2,3,4 are ........
1 votes
1 votes
2 answers
3
pradeepchaudhary asked Aug 19, 2018
2,625 views
What must be the ideal size of array if the height of tree is ‘l’?a) 2l-1b) l-1c) ld) 2l
1 votes
1 votes
1 answer
4
pradeepchaudhary asked Aug 19, 2018
19,105 views
8. What are the worst case and average case complexities of a binary search tree?a) O(n), O(n)b) O(logn), O(logn)c) O(logn), O(n)d) O(n), O(logn)