The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged bst
0
votes
0
answers
1
AVL Tree Balancing
here what to do first as FIZZA and IMRAN both are unbalanced than either to do RR rotation from FIZZAIMRANNAVEEN or RL rotation from IMRANNAVEENLOVELY
asked
Apr 13
in
DS
by
kd.....
Junior
(
783
points)

27
views
avltree
datastructure
tree
bst
algorithms
0
votes
1
answer
2
Internal Path Length of BST
Consider the following binary tree with root at level 0. What is the internal path length for the above tree? 31 14 29 32
asked
Mar 10
in
Algorithms
by
s_dr_13
(
119
points)

92
views
bst
binarysearchtree
tree
datastructure
0
votes
0
answers
3
Optimal BST
what are the applications of optimal binary search tree?
asked
Oct 1, 2018
in
Algorithms
by
aditi19
Active
(
3.7k
points)

32
views
algorithms
bst
obst
–1
vote
0
answers
4
TESTBOOK TEST SERIES
HOW TO SOLVE IT?
asked
Sep 2, 2018
in
Programming
by
Avik Chowdhury
Junior
(
615
points)

54
views
bst
0
votes
0
answers
5
AVL tree
Consider following statements: S1: Rotation operation in AVL always preserves the Inorder ordering. S2: The median of all elements in AVL tree is always at root or one of its two children. S3: If every node in BST has either 0 or 2 children,then searching is O(logn) S4: In a 3 array tree. If number of internal node is 20 then number of Leaves are 41. True Statements ? Ans: Only S1 and S4
asked
Aug 21, 2018
in
DS
by
Na462
Loyal
(
6.6k
points)

272
views
avltree
datastructure
tree
bst
0
votes
1
answer
6
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)
asked
Aug 19, 2018
in
Programming
by
pradeepchaudhary
Active
(
1.1k
points)

96
views
datastructure
binarysearchtree
bst
binarytree
algorithms
+1
vote
1
answer
7
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?
asked
Aug 18, 2018
in
DS
by
srestha
Veteran
(
111k
points)

89
views
datastructure
binarysearchtree
bst
+2
votes
1
answer
8
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?
asked
Aug 17, 2018
in
DS
by
srestha
Veteran
(
111k
points)

179
views
datastructure
bst
binarysearchtree
+1
vote
3
answers
9
CORMEN
What is the asymptotic performance of TREEINSERT when used to insert n items with identical keys into an initially empty binary search tree?
asked
Aug 1, 2018
in
Algorithms
by
Rishav Kumar Singh
Loyal
(
5.4k
points)

44
views
algorithms
bst
+1
vote
1
answer
10
AVL Tree
Let T be a binary search tree with n nodes and Sn be the average number of comparisons required for successful search and Un be the average number of comparison required for an unsuccessful search. Then what is the relation between Sn, Un and n
asked
Jul 16, 2018
in
Programming
by
hrcule
(
209
points)

293
views
avltree
datastructure
tree
bst
0
votes
2
answers
11
Binary search tree preorder
someone please explain this question A binary search tree contains the values 1, 2, 3, 4, 5, 6, 7, 8. The tree is traversed in preorder and the values are printed out. Which of the following sequences is a valid output? how the option D is correct? A 53124786 B 53126487 C 53241678 D 53124768
asked
Jul 5, 2018
in
Study Resources
by
amber12
(
41
points)

182
views
binarysearchtree
treetraversal
bst
+3
votes
0
answers
12
Binary Search Tree
When searching for the key value 30 in a binary search tree, nodes containing the key values 10, 20, 25, 35, 70, 80, 90, 100 are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search ...  what is difference between solution 1) and solution 2)? why in both case answer is different?
asked
Mar 22, 2018
in
DS
by
srestha
Veteran
(
111k
points)

161
views
datastructure
bst
0
votes
2
answers
13
Test Series
Delete the key sequence [6,5,4] from the below AVL tree. How many rotations are needed to make it balanced AVL tree again?
asked
Jan 31, 2018
in
DS
by
Meghaaa2612
(
13
points)

114
views
data
datastructure
avltree
bst
+1
vote
0
answers
14
BST01
In deleting the root element of a BST, we have to replace root with _________ a)Inorder successor b)Inorder predecessor c)Both a and b
asked
Jan 18, 2018
in
DS
by
Anjan
Active
(
1.4k
points)

66
views
datastructure
bst
+3
votes
0
answers
15
AVL tree deletion
When node 50 will be deleted, what will be resultant AVL tree?
asked
Jan 10, 2018
in
Programming
by
AnilGoudar
Active
(
4.3k
points)

421
views
avltree
bst
datastructure
+1
vote
0
answers
16
#of BST
Find number of BST's possible with 6 nodes numbered 1,2,3,4,5 and 6 having 6 as root and height of 4 ? please explain in detail ...
asked
Jan 10, 2018
in
DS
by
Anjan
Active
(
1.4k
points)

68
views
datastructure
bst
+2
votes
2
answers
17
BST(Test Series)
Consider a Binary Search Tree is created using element 1 to n in following order: 3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, ....., n – 3, n – 4, n – 5, n – 2, n – 1, n What is the worst time complexity of searching a number in the Binary Search Tree?
asked
Jan 3, 2018
in
DS
by
VS
Loyal
(
9.8k
points)

263
views
bst
0
votes
1
answer
18
Binary Tree construction
Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong) Construct a binary tree with the nodes A, B, C such that its preorder traversal is ABC and its inorder traversal is CAB.
asked
Nov 8, 2017
in
DS
by
humblefool
Junior
(
933
points)

416
views
datastructure
algorithms
bst
binarytree
treetraversal
binarysearchtree
+1
vote
0
answers
19
BST tree
The number of BST possible with 6 nodes numbered 1,2,3,4,5,6 with exactly 1 leaf node __________
asked
Nov 1, 2017
in
DS
by
srestha
Veteran
(
111k
points)

111
views
datastructure
bst
+3
votes
0
answers
20
Expectation and BST
Here how did we find the number of comparisons for any number.
asked
Oct 29, 2017
in
Algorithms
by
junaid ahmad
Loyal
(
8.4k
points)

157
views
datastructure
bst
+1
vote
2
answers
21
Programming and DS :: BST deletion
What is the time complexity to delete the root node in right skew tree? I knew the three cases of BST deletion: 0 child,one child,two child. But how can we handle this particular question
asked
Oct 6, 2017
in
Programming
by
rahul sharma 5
Boss
(
24.2k
points)

147
views
datastructure
tree
bst
+2
votes
1
answer
22
DS: Construct unique BST
What is the worst case time complexity to construct unique BST from a:) Inorder and preorder a:) Inorder and postorder
asked
Oct 2, 2017
in
Programming
by
rahul sharma 5
Boss
(
24.2k
points)

122
views
datastructure
tree
bst
+1
vote
1
answer
23
Binary search tree construction Doubt
What is the worst case time complexity to construct a binary search tree.??? Now i know ,that if a BST is left or rightskewed, searching an element takes O(n) time.so suppose i want to insert 10,25,30,35,40 in a bst.. it will be completely right skewed.. So when ... so overall work =0+1+2+...+(n1)=N(n1)/2= O(n2) Am i correct here?? or it is O(nlogn)
asked
Jan 25, 2017
in
Algorithms
by
Aboveallplayer
Boss
(
17.7k
points)

539
views
bst
datastructure
algorithms
+7
votes
1
answer
24
Testbook Test Series: Programming & DS  Binary Search Tree
asked
Jan 16, 2017
in
Programming
by
Pankaj Joshi
Active
(
2.6k
points)

467
views
testbooktestseries
probability
datastructure
bst
permutationsandcombinations
+3
votes
2
answers
25
Binary Search tree
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data structure the T will be A. O(log n) B. O(n) C. O(n logn) D. O(n2)
asked
Jan 11, 2017
in
Algorithms
by
Nithish
Active
(
1.5k
points)

658
views
algorithms
binarysearchtree
datastructure
bst
+5
votes
2
answers
26
MadeEasy Subject Test: Programming & DS  Binary Search Tree
The number of BST's possible with $6$ nodes numbered $1$,$2$,$3$,$4$,$5$ and $6$ with exactly one leaf node are ....................... OR The number of BST's possible with $6$ nodes numbered $1$,$2$,$3$,$4$,$5$ and $6$ having a height of $5$ are .................… ( note : height of a root is 0 )
asked
Jan 6, 2017
in
DS
by
Çșȇ ʛấẗẻ
Active
(
1.9k
points)

419
views
datastructure
madeeasytestseries
tree
bst
0
votes
0
answers
27
Preorder/Postorder Tree
I am getting 6 as the answer,but correct answer given is 5.Plese correct.
asked
Dec 19, 2016
in
Programming
by
rahul sharma 5
Boss
(
24.2k
points)

94
views
datastructure
bst
algorithms
0
votes
1
answer
28
BST_traverse
While inserting an element into a BST, we will pass the element’s predecessor and successor (if they exist). (a) Ture (b) false (c) can't be determined.
asked
Nov 22, 2016
in
Algorithms
by
dd
Veteran
(
56.5k
points)

129
views
datastructure
binarysearchtree
bst
+2
votes
3
answers
29
Binary Search Tree
Suppose we do not have a parent pointer in the nodes of a search tree, only leftchild and rightchild. Which of the following operations can be computed in time $O(\log n)$ for a balanced search tree? 1 find, insert, delete, but not min, max, pred, succ 2 ... pred, succ 3 find, insert, delete, pred, succ but not min, max 4 All of find, insert, delete, min, max, pred, succ
asked
Aug 23, 2016
in
Algorithms
by
dd
Veteran
(
56.5k
points)

1.1k
views
binarysearch
algorithms
datastructure
bst
binarytree
+2
votes
1
answer
30
UGCNETJune2016III35
Suppose that we have numbers between 1 and 1,000 in a binary search tree and want to search for the number 364. Which of the following sequences could not be the sequence of nodes examined? 925, 221, 912, 245, 899, 259, 363, 364 3, 400, 388, 220, 267, 383, 382, 279, 364 926, 203, 912, 241, 913, 246, 364 3, 253, 402, 399, 331, 345, 398, 364
asked
Aug 20, 2016
in
DS
by
jothee
Veteran
(
96.1k
points)

3.7k
views
ugcnetjune2016iii
datastructure
bst
Page:
1
2
next »
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
IIITH Interview Experience
Thanks GO!!
IIIT Hyerabad Interview Expeience  MS by Research in CSE
The day that made me an IIScian :)
Unanswered Previous year GATE/TIFR questions
Follow @csegate
Recent questions tagged bst
Recent Blog Comments
thanku :)
thanku :)
Congratulations :)
Congratulations 😊 👍
Thank you bro @Shaik
49,532
questions
54,126
answers
187,326
comments
71,046
users