Register

Recent questions tagged binary-search-tree

4 votes
5 answers
91
How many Binary Search Trees are possible for a labelled nodes?
Let us there are n nodes which are labelled. Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$ Then the binary search trees possible is just $1$?
Let us there are n nodes which are labelled.Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$Then the binary search trees possi...
User Avatar
0 votes
1 answer
93
Binary serach tree
Can binary serach tree have duplicate elements in the tree?
Can binary serach tree have duplicate elements in the tree?
User Avatar
0 votes
2 answers
98
UGC NET CSE | December 2018 | Part 2 | Question: 25
A binary search tree is constructed by inserting the following numbers in order : $60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34$ The number of nodes in the left subtree is $5$ $6$ $7$ $3$
A binary search tree is constructed by inserting the following numbers in order :$60, 25, 72, 15, 30, 68, 101, 13, 18, 47, 70, 34$The number of nodes in the left subtree ...
User Avatar
0 votes
1 answer
99
Binary search trees
the number of binary search trees with 4 nodes (1 , 2 , 3 , 4) where 1 is always a leaf node?
the number of binary search trees with 4 nodes (1 , 2 , 3 , 4) where 1 is always a leaf node?
User Avatar
1 votes
1 answer
102
NIELIT 2018-67
____ is the worst-case time complexity for all operations (i.e.,) search, update and delete) in a general Binary Search tree $O(n)$ $O(n \log n)$ $O( \log n)$ for search and insert, and $O(n)$ for delete None of these
____ is the worst-case time complexity for all operations (i.e.,) search, update and delete) in a general Binary Search tree$O(n)$$O(n \log n)$$O( \log n)$ for search and...
User Avatar
0 votes
0 answers
103
SELF DOUBT BINARY SEARCH
https://gateoverflow.in/132037/self-doubt-in-binary-search-algo DOUBT : THIS QUESTION 10 ELEMENTS ARE IN ARRAY AND SORTED THEN HOW CAN WE DRAW A BALANCED TREE BECZ IT IS ALWAYS GIVING SKEWED TREE.
https://gateoverflow.in/132037/self-doubt-in-binary-search-algoDOUBT : THIS QUESTION 10 ELEMENTS ARE IN ARRAY AND SORTED THEN HOW CAN WE DRAW A BALANCED TREE BECZ IT I...
User Avatar
0 votes
0 answers
106
Binary Search Tree
Consider a binary search tree for the following sequence of nodes $a,b,g,f,c,e,d$ What is the resultant tree if splaying is done at $'d'.$
Consider a binary search tree for the following sequence of nodes $a,b,g,f,c,e,d$What is the resultant tree if splaying is done at $'d'.$
User Avatar
0 votes
0 answers
107
Labelled Binary Tree
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 ........
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 ........
User Avatar
0 votes
1 answer
108
Optimal BST
what are the applications of optimal binary search tree?
what are the applications of optimal binary search tree?
User Avatar
–1 votes
0 answers
110
TESTBOOK TEST SERIES
HOW TO SOLVE IT?
HOW TO SOLVE IT?
User Avatar
0 votes
1 answer
112
Recurrence Relation of BST
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) + 2 2) T(n) = T(n/2) + 1
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) +...
User Avatar
1 votes
2 answers
114
Binary Tree Array Implementation
What must be the ideal size of array if the height of tree is ‘l’? a) 2l-1 b) l-1 c) l d) 2l
What must be the ideal size of array if the height of tree is ‘l’?a) 2l-1b) l-1c) ld) 2l
User Avatar
1 votes
1 answer
115
Binary Search Tree
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)
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)
User Avatar
1 votes
1 answer
116
Binary Search Tree
1) How many ways we can traverse 1,2,3,4 in BST? 2) How many ways we can insert 1,2,3,4 in BST? ______________________________________________________________________ How both are different in calculation of BST?Why they are use different formula?
1) How many ways we can traverse 1,2,3,4 in BST?2) How many ways we can insert 1,2,3,4 in BST?______________________________________________________________________How bo...
User Avatar
1 votes
1 answer
118
ace test series
Consider the following instance of OBST (Optimal Binary Search Tree) Problem. n=4;<a1,a2,a3,a4>=<do,if,int,while> P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1> The Cost of OBST(optimal binary search tree) is________
Consider the following instance of OBST (Optimal Binary Search Tree) Problem.n=4;<a1,a2,a3,a4>=<do,if,int,while>P(1....4)=<3,3,1,1>; Q(0....4)=<2,3,1,1,1>The Cost of OBS...
User Avatar
2 votes
1 answer
119
Binary Search Tree
Number of ways we can insert 5,6,9,10 in the nodes of BST, such that height of BST is either 2 or 3?
Number of ways we can insert 5,6,9,10 in the nodes of BST, such that height of BST is either 2 or 3?
User Avatar
Page: