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 tree
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
(
789
points)

29
views
avltree
datastructure
tree
bst
algorithms
0
votes
0
answers
2
Made Easy:Programming &DS
The number of possible ordered trees with 3 nodes A,B,C is ??
asked
Mar 22
in
DS
by
sandeep singh gaur
(
243
points)

55
views
tree
0
votes
1
answer
3
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
(
133
points)

95
views
bst
binarysearchtree
tree
datastructure
0
votes
1
answer
4
avl tree
what is the maximum possible hight of AVL tree with 54 node? is there any general method to solve this question?
asked
Dec 28, 2018
in
DS
by
Rahul_Rathod_
(
415
points)

132
views
avltree
datastructure
tree
0
votes
0
answers
5
AVL TREES
Please suggest how to learn AVL rotation in AVL trees and some good practice questions or link would be so much helpful Thanks
asked
Nov 2, 2018
in
Programming
by
Mayankprakash
Junior
(
987
points)

64
views
avltree
tree
datastructure
0
votes
1
answer
6
DBMS basic test1
asked
Oct 27, 2018
in
Databases
by
Shivani gaikawad
Junior
(
603
points)

65
views
databases
btree
tree
0
votes
0
answers
7
# Binomial tree # Binomial Heap
What is Binomial tree please explain in easy words. Construct the Binomial heap for the following sequence of numbers 7,2,4,17,1,11,6,8,15,10,20. Also apply the operation of extracting the minimum key in the resulting binomial Heap.
asked
Sep 10, 2018
in
Algorithms
by
LavTheRawkstar
Active
(
3.7k
points)

88
views
algorithms
heap
sorting
datastructure
binomial
tree
btree
0
votes
0
answers
8
AVL tree
How to solve question of the following type without creating a tree for each given option. Which of the following order of elements are inserted into an empty AVL tree so that it is possible to get the above AVL tree. A. 94,71,86,25,98,83,27,90 B 98,94,90,83,86,25,71,27 C. 86,25,98,83,27,90,71,94 D. None of these
asked
Aug 27, 2018
in
DS
by
hrcule
(
209
points)

83
views
avltree
datastructure
tree
0
votes
0
answers
9
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)

283
views
avltree
datastructure
tree
bst
0
votes
1
answer
10
Tree DS
1. How many Binary trees can be made with: (a) 3 unlabelled nodes? (b) 3 labelled nodes? 2. How many Binary Search trees can be made with: (a) 3 unlabelled nodes? (b) 3 labelled nodes? 3. How many AVL trees can be made with: (a) 3 unlabelled nodes? (b) 3 labelled nodes? Can these be generalised for 'n' nodes?
asked
Aug 4, 2018
in
DS
by
Naveen Kumar 3
Boss
(
14k
points)

106
views
datastructure
tree
+1
vote
1
answer
11
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)

301
views
avltree
datastructure
tree
bst
+1
vote
1
answer
12
proof
how the b and b+ tree formulae computed can u explain with the proof
asked
Jun 24, 2018
in
Databases
by
vijju532
Junior
(
997
points)

116
views
btree
btree
tree
0
votes
1
answer
13
trees data structure
Is the root node an internal node?
asked
Jun 24, 2018
in
Programming
by
once_2019
Junior
(
569
points)

90
views
datastructure
tree
programminginc
0
votes
0
answers
14
data structure
how does linux kernel uses the red black tree property ???elabourate
asked
Jun 13, 2018
in
Algorithms
by
vijju532
Junior
(
997
points)

37
views
datastructure
algorithms
tree
0
votes
1
answer
15
AVL Tree
Minimum number of internal nodes in an AVL tree with height 5? Please give a standard procedure that can be applied to larger heights as well. I know the formula: S(h) = S(h1) + S(h2) + 1, but here it is asked for internal nodes only. Drawing a tree is tedious.
asked
May 15, 2018
in
DS
by
Akhilesh Singla
Loyal
(
5.2k
points)

133
views
avltree
tree
0
votes
1
answer
16
BST Data Structure
a:) If given Tree is BST => Inorder of keys is sorted b:) Inorder of keys is sorted => Tree is BST(converse of above) I know first one holds.Is second one also true?If not can someone give counter example?
asked
Apr 12, 2018
in
Programming
by
rahul sharma 5
Boss
(
24.4k
points)

138
views
datastructure
algorithms
programminginc
tree
0
votes
2
answers
17
Tree question
In delete operation of BST, we need inorder successor (or predecessor) of a node when the node to be deleted has both left and right child as nonempty. Which of the following is true about inorder successor needed in delete operation? Inorder Successor ... Inorder successor may be an ancestor of the node Inorder successor is always either a leaf node or a node with empty right child
asked
Mar 21, 2018
in
DS
by
Mohit Srivastava
(
35
points)

279
views
datastructure
tree
+2
votes
1
answer
18
AVL tree
Consider the following elements inserted into an empty AVL tree in the following order 25, 10, 15, 17, 30, 35, 40, 21, 28 If [L(d)] be the sum of elements on left side of root and (Rd) be the sum of elements on right side of root, then the value of [(Rd) – (Ld) + Root] is ________.
asked
Mar 11, 2018
in
DS
by
pankaj_vir
Boss
(
10.4k
points)

127
views
avltree
datastructure
tree
+1
vote
0
answers
19
AVL Tree
Suppose we have an AVL tree of n nodes and any change in the tree violates the AVL tree property then : S1: If we insert an element in the tree, maximum 2 Rotations are required to make the Tree AVL again. S2: If we delete an element from the tree, maximum 2 Rotations are required to make tree AVL again Which are correct statements?
asked
Jan 28, 2018
in
DS
by
gauravkc
Loyal
(
7.7k
points)

88
views
avltree
datastructure
tree
+2
votes
0
answers
20
DS TREES
Consider a binary tree T that has 150 leaf nodes. Then the number of TOTAL nodes in T that have exactly two children are ______.
asked
Jan 7, 2018
in
DS
by
iarnav
Loyal
(
7.9k
points)

171
views
datastructure
tree
binarytree
0
votes
1
answer
21
B+ Tree Question
Does values in Leaf nodes of B+ tree repeats or ever leaf node has an unique value?
asked
Dec 15, 2017
in
Databases
by
iarnav
Loyal
(
7.9k
points)

340
views
btree
bplustrees
databases
indexing
tree
+1
vote
1
answer
22
B+ tree
Assume a system has following parameters to construct a B+ tree. The specification of the tree are: • Size of search key is 15 B • Size of block is 512 B • Size of record pointer is 9 B • Size of block pointer is 8 B The maximum number of keys that can be accommodated in each nonleaf node of the tree is ________.
asked
Nov 30, 2017
in
Databases
by
Tuhin Dutta
Loyal
(
9.1k
points)

253
views
databases
btree
tree
0
votes
2
answers
23
AVL tree rotations
asked
Nov 29, 2017
in
DS
by
Parshu gate
Active
(
3.1k
points)

144
views
avltree
datastructure
algorithms
tree
+2
votes
0
answers
24
Data Structure
asked
Nov 14, 2017
in
Programming
by
Lakshman Patel RJIT
Boss
(
41.8k
points)

62
views
tree
+1
vote
2
answers
25
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.4k
points)

147
views
datastructure
tree
bst
+2
votes
1
answer
26
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.4k
points)

122
views
datastructure
tree
bst
+1
vote
1
answer
27
trees in data structure
QWe are given set of n distinct elements and an unlabled binary tree with n nodes how many ways we can populate the tree with given set so that it becomes binary search tree ?
asked
Jun 26, 2017
in
Programming
by
cjoshi
(
11
points)

94
views
tree
0
votes
2
answers
28
Data Structure InOrder Predecessor
If a node in a BST has two children, then its inorder predecessor has a) No left child b) No right child c) 2 children d) no child
asked
Feb 8, 2017
in
DS
by
smartmeet
Active
(
4.8k
points)

2.1k
views
datastructure
tree
treetraversal
0
votes
2
answers
29
data structure tree doubt
A 5ary tree is a tree in which every internal node has 3 children.The number of leaf nodes in such a tree with 10 internal nodes is______
asked
Jan 24, 2017
in
Programming
by
iita
Junior
(
927
points)

208
views
nary
tree
+2
votes
1
answer
30
Virtual Gate Test Series: Programming & DS  Tree
The minimum number of vertices having degree $1$ in a tree of at least $10$ vertices is ______________. If we consider this question, then the first answer comes in our mind is $'2',$ right? But what if Tree isn't binary? if the root node has $9$ leaf nodes, so all those nodes having degree $1,$ right$?$ So the answer could be$:9$
asked
Jan 18, 2017
in
DS
by
smartmeet
Active
(
4.8k
points)

177
views
datastructure
tree
virtualgatetestseries
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
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
How to prepare for GATE with a fulltime job??
Interview Experience at IISc
All subject Gate notes from Standard Books!!
My journey from Wipro to an IISc student  GATE 2019
Follow @csegate
Recent questions tagged tree
Recent Blog Comments
@Anmol 300 books will be dispatched this month...
Dear Respected Sir, If I prebook now i.e.22...
Can you check your Spam too? Address confirmation...
yeah me too. I did not get the address...
49,814
questions
54,521
answers
188,389
comments
75,427
users