Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged binary-search-tree
2
votes
1
answer
61
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___.
LRU
asked
in
DS
Nov 22, 2021
by
LRU
837
views
data-structures
binary-search-tree
numerical-answers
applied-gate-test-series
1
vote
1
answer
62
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
LRU
asked
in
DS
Oct 4, 2021
by
LRU
476
views
data-structures
binary-search-tree
applied-gate-test-series
0
votes
2
answers
63
#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: The height of a tree with a single node is 0.
Divyanshu Shukla
asked
in
DS
Sep 20, 2021
by
Divyanshu Shukla
697
views
binary-search-tree
data-structures
numerical-answers
1
vote
1
answer
64
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
abhi1998
asked
in
Algorithms
Sep 13, 2021
by
abhi1998
222
views
algorithms
binary-search-tree
18
votes
3
answers
65
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(n\log n)$ $\Theta(n)$ $\Theta(\log n)$ $\Theta (1)$
Arjun
asked
in
DS
Feb 18, 2021
by
Arjun
11.5k
views
gatecse-2021-set1
data-structures
binary-search-tree
time-complexity
1-mark
1
vote
1
answer
66
NIELIT Scientific Assistant A 2020 November: 93
When we perform in order traversal on a binary tree, we get the ascending order array. The tree is: Heap tree almost complete binary tree Binary search tree Cannot be determined
gatecse
asked
in
DS
Dec 9, 2020
by
gatecse
341
views
nielit-sta-2020
data-structures
binary-search-tree
1
vote
1
answer
67
NIELIT 2016 MAR Scientist C - Section C: 50
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 its postorder traversal. What is the time complexity of the most efficient ... $\Theta(n)$ $\Theta(n \log n)$ None of the above, as the tree cannot be uniquely determined.
admin
asked
in
DS
Apr 2, 2020
by
admin
830
views
nielit2016mar-scientistc
data-structures
binary-search-tree
2
votes
1
answer
68
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 5
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 valid output? $5\;\;3\;\;1\;\;2\;\;4\;\;7\;\;8\;\;6\;\;$ ... $5\;\;3\;\;2\;\;4\;\;1\;\;6\;\;7\;\;8$ $5\;\;3\;\;1\;\;2\;\;4\;\;7\;\;6\;\;8$
admin
asked
in
DS
Apr 1, 2020
by
admin
717
views
nielit2017oct-assistanta-cs
data-structures
binary-search-tree
tree-traversal
2
votes
2
answers
69
NIELIT 2017 DEC Scientific Assistant A - Section B: 2
In binary search tree which traversal is used for getting ascending order values ? Inorder Preorder Postorder None of the options
admin
asked
in
DS
Mar 31, 2020
by
admin
952
views
nielit2017dec-assistanta
data-structures
binary-search-tree
tree-traversal
1
vote
3
answers
70
NIELIT 2017 DEC Scientist B - Section B: 30
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$ $31,11,23,50,41,62,73$ $11,31,50,23,73,62,41$ $11,31,23,50,62,73,41$
admin
asked
in
DS
Mar 30, 2020
by
admin
1.7k
views
nielit2017dec-scientistb
data-structures
binary-search-tree
tree-traversal
0
votes
1
answer
71
UGC NET CSE | December 2005 | Part 2 | Question: 25
Which traversal techniques lists the nodes of a binary search tree in ascending order? post – order in – order pre – order linear – order
go_editor
asked
in
DS
Mar 27, 2020
by
go_editor
299
views
ugcnetcse-dec2005-paper2
data-structures
binary-search-tree
0
votes
4
answers
72
UGC NET CSE | January 2017 | Part 2 | Question: 25
Which of the following statements is false? Optimal binary search tree construction can be performed efficiently using dynamic programming. Breadth-first search cannot be used to find connected components of a graph. Given the prefix ... cannot be reconstructed uniquely. Depth-first-search can be used to find the connected components of a graph.
go_editor
asked
in
Algorithms
Mar 24, 2020
by
go_editor
3.9k
views
ugcnetjan2017ii
algorithms
binary-tree
binary-search-tree
8
votes
5
answers
73
GATE CSE 2020 | Question: 5
The preorder traversal of a binary search tree is $15, 10, 12, 11, 20, 18, 16, 19$. Which one of the following is the postorder traversal of the tree? $10,11,12,15,16,18,19,20$ $11,12,10,16,19,18,20,15$ $20,19,18,16,15,12,11,10$ $19,16,18,20,11,12,10,15$
Arjun
asked
in
DS
Feb 12, 2020
by
Arjun
18.6k
views
gatecse-2020
binary-search-tree
1-mark
29
votes
4
answers
74
GATE CSE 2020 | Question: 41
In a balanced binary search tree with $n$ elements, what is the worst case time complexity of reporting all elements in range $[a,b]$? Assume that the number of reported elements is $k$. $\Theta (\log n)$ $\Theta (\log n +k)$ $\Theta (k \log n)$ $\Theta ( n \log k)$
Arjun
asked
in
DS
Feb 12, 2020
by
Arjun
21.8k
views
gatecse-2020
data-structures
binary-search-tree
2-marks
2
votes
3
answers
75
ISRO2020-19
What is the in-order successor of $15$ in the given binary search tree? $18$ $6$ $17$ $20$
Satbir
asked
in
DS
Jan 13, 2020
by
Satbir
2.1k
views
isro-2020
data-structures
binary-search-tree
easy
1
vote
1
answer
76
Cormen Edition 3 Exercise 12.1 Question 5 (Page No. 289)
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$ from an arbitrary list of n elements takes $\Omega (n\ lgn)$ time in the worst case.
KUSHAGRA गुप्ता
asked
in
Algorithms
Nov 20, 2019
by
KUSHAGRA गुप्ता
1.5k
views
cormen
algorithms
descriptive
binary-search-tree
binary-tree
tree
5
votes
4
answers
77
CMI2019-A-3
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, in terms of value, of the root node $A?$ $D$ $H$ $I$ $M$
gatecse
asked
in
DS
Sep 13, 2019
by
gatecse
2.3k
views
cmi2019
data-structures
tree
binary-search-tree
1
vote
1
answer
78
AVL Tree Balancing
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
kd.....
asked
in
DS
Apr 13, 2019
by
kd.....
760
views
avl-tree
data-structures
tree
binary-search-tree
algorithms
0
votes
1
answer
79
Is there any good content available online for OPTIMAL BINARY SEARCH TREE? Preferably Videos.
Suggestions on good content for Optimal Binary Search Tree.
`JEET
asked
in
DS
Jan 19, 2019
by
`JEET
471
views
data-structures
binary-search-tree
reference-book
2
votes
1
answer
80
#Ace_Test_series.
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 the most efficient algorithm of the same is $O(n^2)$ $O(n^3)$ $O(n\log n)$ $O(n^3\log n)$
`JEET
asked
in
DS
Jan 19, 2019
by
`JEET
480
views
data-structures
binary-search-tree
time-complexity
ace-test-series
0
votes
0
answers
81
#ACE_Test_Series
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,3,1,1,1> The cost of OBST is________.
`JEET
asked
in
Algorithms
Jan 19, 2019
by
`JEET
1.0k
views
ace-test-series
algorithms
binary-search-tree
4
votes
1
answer
82
Applied Course | Mock GATE | Test 1 | Question: 34
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)$ $\theta (\log n)$ rotations are required to insert into AVL tree with n nodes. Only I Only II Both I and II Neither I nor II
Applied Course
asked
in
DS
Jan 16, 2019
by
Applied Course
637
views
applied-course-2019-mock1
data-structures
binary-search-tree
1
vote
1
answer
83
Applied Course | Mock GATE | Test 1 | Question: 43
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, 60$. What is the length of the longest path from one leaf to another leaf. (Note: Length of longest path means total number of nodes present in that path).
Applied Course
asked
in
DS
Jan 16, 2019
by
Applied Course
728
views
applied-course-2019-mock1
numerical-answers
data-structures
binary-search-tree
Page:
« prev
1
2
3
4
5
6
7
8
9
next »
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
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
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent questions tagged binary-search-tree
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...