Recent questions tagged binary-search-tree

Binary search tree contains the values $\text{1, 2, 3, 4, 5, 6, 7, 8}$. The tree is traversed in pre-order and the values are printed out. Which of the following sequence...

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...

You are given the postorder traversal, $P$, of a binary search tree on the $n$ elements $1,2,\dots,n.$ You have to determine the unique binary search tree that has $P$ as...

A binary search tree contains the values-$1,2,3,4,5,6,7$ and $8.$ The tree is traversed in preorder and the values are printed out. Which of the following sequences is a ...

In binary search tree which traversal is used for getting ascending order values ?InorderPreorderPostorderNone of the options

If for a given Binary Search Tree (BST) the pre-order traversal is $41,23,11,31,62,50,73$. Then which of the following is its post-order traversal?$11,31,23,50,73,62,41$$...

Which traversal techniques lists the nodes of a binary search tree in ascending order?post – orderin – orderpre – orderlinear – order

Which of the following statements is false?Optimal binary search tree construction can be performed efficiently using dynamic programming.Breadth-first search cannot be u...

What is the in-order successor of $15$ in the given binary search tree?$18$$6$$17$$20$

Argue that since sorting $n$ elements takes $\Omega (n\ lgn)$ time in the worst case in the comparison model, any comparison-based algorithm for constructing a $BST$ fro...

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...

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

Suggestions on good content for Optimal Binary Search Tree.

Consider the problem of construction of a minimum cost binary search tree for a given set of ‘$n$’ identifiers with their respective probabilities. The time complexity of...

Which of the following statements is/are TRUE?Suppose there are $n$ nodes are present in a binary search tree. The height of any binary search tree is $\theta (\log n)$$\...

The postorder traversal of a binary search tree is $25, 33, 30, 35, 42, 48, 40, 60, 58, 50$. The inorder traversal of the same tree is $25, 30, 33, 35, 40, 42, 48, 50, 58...

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...

Can binary serach tree have duplicate elements in the tree?