Register

Recent questions tagged binary-search-tree

0 0 votes
0 0 answers
516
516 views
Best Open Video Playlist for Binary search Trees Topic | Data structures
Please list out the best free available video playlist for Binary search Trees from Data structures as an answer here (only one playlist per answer). We'll then select th...
User Avatar
0 0 votes
2 2 answers
577
577 views
NIELIT 2021 Dec Scientist B - Section B: 74
The preorder traversal of a binary search tree is given by $12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20$.Then postorder traversal will be:$2, 6, 7, 8, 9, 10, 12, 15, 16, 17...
User Avatar
2 2 votes
1 1 answer
1.0k
1.0k views
NIELIT 2022 April Scientist B | Section B | Question: 59
Let $\text{T}$ be a binary search tree with $15$ nodes. The minimum and maximum possible heights of $\text{T}$ are:The height of a tree with a single node is $0$.$4$ and ...
User Avatar
127 127 votes
10 answers 10 answers
41.4k
41.4k views
GATE CSE 2022 | Question: 18
Suppose a binary search tree with $1000$ distinct elements is also a complete binary tree. The tree is stored using the array representation of binary heap trees. Assumin...
User Avatar
0 0 votes
2 2 answers
1.0k
1.0k views
NIELIT 2021 Dec Scientist A - Section B: 47
Suppose a binary search tree has been constructed from the following sequence of numbers in the order in which they arrive : $6, 2, 10, 1, 5, 7, 11, 3, 9, 4, 8.$ Consider...
User Avatar
0 0 votes
1 1 answer
610
610 views
NIELIT 2021 Dec Scientist A - Section B: 61
Let $\text{T(n)}$ be the number of different binary search trees on $\text{n}$ distinct elements-then $\text{T(n)} = \displaystyle{\sum_{k=1}^{n}} \text{T(K-1)} \; T(x)$ ...
User Avatar
5 5 votes
2 2 answers
2.1k
2.1k views
Applied Test series: DS
The number of insertion sequences of the numbers {1,2,3,4,5,6,7} which would lead to the following BSTHow to tackle this kind of problem. Anyone!
User Avatar
1 1 vote
1 1 answer
1.1k
1.1k views
NPTEL Assignment Question
What is the complexity of inorder traversal for a binary search tree with n nodes? O(log n) whether the tree is balanced or unbalanced.O(log n) if the tree is balanced, O...
User Avatar
2 2 votes
0 0 answers
526
526 views
TestBook
In a Binary Search Tree, a key with value 5 was searched after traversing nodes with values 1,3,4,6,7,8,9 not necessary in the same order. Lets P is the probability that ...
User Avatar
2 2 votes
1 answers 1 answer
1.3k
1.3k views
Applied Grand Test 2
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___.
User Avatar
1 1 vote
1 answers 1 answer
883
883 views
Applied Test Series
Worst case time required to construct a balanced BST given a sorted array of integers which can be inserted in any order
User Avatar
0 0 votes
2 2 answers
1.3k
1.3k views
#self_doubt #BST
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...
User Avatar
1 1 vote
1 1 answer
491
491 views
I have a doubt in this Question , please give me hint
In a randomised BST is constructing with 7 distinct elements . What is the probability that its Inorder and postOrder traversal are same
User Avatar
60 60 votes
8 answers 8 answers
27.0k
27.0k views
GATE CSE 2021 | Set 1 | Question: 10
A binary search tree $T$ contains $n$ distinct elements. What is the time complexity of picking an element in $T$ that is smaller than the maximum element in $T$?$\Theta(...
User Avatar
Page: