Recent questions tagged binary-search-tree

2 votes
1 answer
61
Number different of binary search trees which can be created with the elements {12, 34, 22, 43, 13, 45, 55, 94, 99, 23} with 45 as the root is___.
1 votes
1 answer
62
Worst case time required to construct a balanced BST given a sorted array of integers which can be inserted in any order
0 votes
2 answers
63
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 $5$, is _________.Note: Th...
1 votes
1 answer
64
In a randomised BST is constructing with 7 distinct elements . What is the probability that its Inorder and postOrder traversal are same
18 votes
3 answers
65
1 votes
1 answer
66
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is:Heap treealmost complete binary treeBinary search treeCannot be determi...
2 votes
2 answers
69
0 votes
1 answer
71
Which traversal techniques lists the nodes of a binary search tree in ascending order?post – orderin – orderpre – orderlinear – order
8 votes
5 answers
73
29 votes
4 answers
74
2 votes
3 answers
75
What is the in-order successor of $15$ in the given binary search tree?$18$$6$$17$$20$
5 votes
4 answers
77
Suppose that the figure to the right is a binary search tree. The letters indicate the names of the nodes, not the values that are stored. What is the predecessor node, i...
1 votes
1 answer
78
here what to do first as FIZZA and IMRAN both are unbalanced than either to do RR rotation from FIZZA-IMRAN-NAVEEN or RL rotation from IMRAN-NAVEEN-LOVELY
0 votes
0 answers
81
Consider the following instance of OBST (Optimal Binary search Tree) problem.N = 4; <$a_1$, $a_2$, $a_3$, $a_4$ = <do, if, int, while>P(1...4) = <3,3,1,1>; Q(0...4) = <2,...