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

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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 trees
0
votes
0
answers
1
compile design question from runtime environment
asked
Apr 16
in
Compiler Design
by
Ronish Jariwala 1
(
87
points)

40
views
runtimeenvironments
compilerdesign
hashing
trees
0
votes
0
answers
2
Number of Possible Trees
How many total Homeomorphically Irreducible Trees are possible with 'n' nodes ?
asked
Apr 11
in
Graph Theory
by
ankitgupta.1729
Loyal
(
6.1k
points)

61
views
graphtheory
discretemathematics
trees
0
votes
1
answer
3
Uttrakhand Asst. Professor Exam39
If the post order traversal of tree gives $ab  cd * +$, then the label of the nodes A, B, C, ......, G will be a, , b, +, c, *, d +, , *, a, b, c, d , a, +, b, c, d, * a, b, c, d, , *, +
asked
Mar 2
in
Others
by
gatecse
Boss
(
18k
points)

59
views
uttarakhandasstprof2018
datastructure
trees
0
votes
1
answer
4
Doubt regarding deletion from a Btree
After deleting an element from a Btree,I could rearrange the tree in several ways,that would still complies to the rules of Btrees.But,we are supposed to follow a certain set of rules for rearranging the tree after deleting an element. Why is that ?
asked
Mar 1
in
Algorithms
by
Mathews George
(
15
points)

75
views
btree
datastructure
trees
+1
vote
1
answer
5
B+ tree
$\text{Insertion Sequence}$ : $8,5,1,7,3,12,9,6$ Can someone plz show the Sequence of insertion in B+ tree step by step Thanks
asked
Dec 7, 2017
in
Databases
by
Pawan Kumar 2
Active
(
4.5k
points)

66
views
btree
trees
bplustrees
+3
votes
4
answers
6
The gate book
Which of the following need not be a binary tree? (a) Heap (b) BTree (c) AVL Tree (d) None of these
asked
Aug 18, 2017
in
DS
by
Lakshman Patel RJIT
Loyal
(
7.7k
points)

795
views
trees
+2
votes
1
answer
7
The gate book
3. The number of possible ordered trees with 3 nodes A, B, C is: A)12 B)16 C)6 D)10
asked
Aug 18, 2017
in
Programming
by
Lakshman Patel RJIT
Loyal
(
7.7k
points)

172
views
trees
+10
votes
2
answers
8
ISI Entrance Exam MTech (CS)
Consider all possible trees with $n$ nodes. Let $k$ be the number of nodes with degree greater than $1$ in a given tree. What is the maximum possible value of $k$?
asked
Apr 6, 2017
in
Graph Theory
by
Shreya Roy
Active
(
4.3k
points)

632
views
isi2016
graphtheory
trees
descriptive
+3
votes
3
answers
9
Trees
What is the difference between height and levels for a tree. What will be the value of height and level for root node and why?
asked
Apr 4, 2017
in
Algorithms
by
Srinivas Rao
(
391
points)

227
views
binarytree
trees
+18
votes
6
answers
10
GATE2017120
Let $T$ be a tree with $10$ vertices. The sum of the degrees of all the vertices in $T$ is ________
asked
Feb 14, 2017
in
DS
by
Arjun
Veteran
(
349k
points)

3k
views
gate20171
datastructure
trees
numericalanswers
+1
vote
1
answer
11
Made EasyCBT2017Q33
asked
Jan 22, 2017
in
DS
by
Devwritt
Active
(
3k
points)

799
views
madeeasytestseries
cbt2017
datastructure
trees
+2
votes
1
answer
12
When they don't mention type of tree then if it's mandatory to take 'Binary Tree'(Check Description)
asked
Jan 18, 2017
in
Graph Theory
by
smartmeet
Active
(
4.8k
points)

132
views
discretemathematics
engineeringmathematics
virtualgate
graphtheory
trees
+3
votes
3
answers
13
virtualgate2015 DS
What is the correct answer?
asked
Jan 12, 2017
in
DS
by
Purple
Active
(
3.5k
points)

242
views
virtualgate
testseries
datastructure
binarytree
trees
+2
votes
2
answers
14
GATE199013a
Consider the heightbalanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig.4. (i) Show how to merge to the tree, $T_{1}$ elements from tree $T_{2}$ shown in Fig.5 using node D of tree $T_{1}$. (ii) What is the time complexity of ... }$ where $T_{1}$ and $T_{2}$ are of height $h_{1}$ and $h_{2}$ respectively, assuming that rotation schemes are given. Give reasons.
asked
Nov 26, 2016
in
DS
by
makhdoom ghaya
Boss
(
40k
points)

249
views
gate1990
descriptive
datastructure
trees
+4
votes
1
answer
15
Trees
asked
Nov 22, 2016
in
DS
by
thor
Loyal
(
7.9k
points)

178
views
trees
binarytree
0
votes
0
answers
16
Made Easy Test Series:,
A 4ary i.e., either has 0 children or has 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ________. The correct answer given is 27 . Where my solution is wrong? Let ' I ' denote number of internal nodes so, I*4 = I + 20 1 I = 19/3 therefore 20 leaf nodes in above tree not possible.
asked
Nov 17, 2016
in
Programming
by
Shivam Chauhan
Loyal
(
8.7k
points)

187
views
madeeasytestseries
trees
+1
vote
1
answer
17
Trees
There are nn2 labeled trees with n vertices(n>2) Can anyone explain it with complete proof?
asked
Oct 16, 2016
in
Programming
by
Prajwal Bhat
Boss
(
11.3k
points)

157
views
trees
graphtheory
+1
vote
3
answers
18
UGCNETJune2010II32
Which of the following expression is represented by the parse tree ? $(A + B) ^{*} C$ $A + ^{*} BC$ $A + B * C$ $A * C + B$
asked
Sep 16, 2016
in
DS
by
makhdoom ghaya
Boss
(
40k
points)

189
views
ugcnetjune2010ii
datastructure
trees
+1
vote
1
answer
19
UGCNETJune2010II23
In a complete binary tree of n nodes, how far are the two most distant nodes ? Assume each edge in the path counts as ! About $\log_{2} n$ About $2 \log_{2} n$ About $n \log_{2} n$ About $2n$
asked
Sep 16, 2016
in
DS
by
makhdoom ghaya
Boss
(
40k
points)

460
views
ugcnetjune2010ii
datastructure
trees
+6
votes
4
answers
20
DSA
a 4ary tree has either 4 or 0 children,What is the total number of nodes when there are 20 leaf node?
asked
Sep 4, 2016
in
Programming
by
Aboveallplayer
Boss
(
18.4k
points)

421
views
trees
+3
votes
2
answers
21
UGCNETJune2016II23
Suppose you are given a binary tree with n nodes, such that each node has exactly eiter zero or two children. The maximum height of the tree will be $\frac{n}{2}1$ $\frac{n}{2}+1$ $(n1)/2$ $(n+1)/2$
asked
Aug 16, 2016
in
DS
by
jothee
Veteran
(
98.5k
points)

893
views
ugcnetjune2016ii
datastructure
trees
+1
vote
1
answer
22
UGCNETDec2015II37
The number of disk pages access in Btree search, where h is height, n is the number of keys and t is the minimum degree, is $\theta (\log_n h*t)$ $\theta (\log_t n*h)$ $\theta (\log_h n)$ $\theta (\log_t n)$
asked
Aug 8, 2016
in
Algorithms
by
jothee
Veteran
(
98.5k
points)

783
views
ugcnetdec2015ii
algorithms
trees
+3
votes
2
answers
23
UGCNETDec2015II5
A tree with n vertices is called graceful, if its vertices can be labelled with integers 1, , ..., n such that the absolute value of the difference of the labels of adjacent vertices are all different. Which of the following trees are graceful? a and b b and c a and c a, b,and c
asked
Aug 3, 2016
in
DS
by
jothee
Veteran
(
98.5k
points)

1.1k
views
ugcnetdec2015ii
datastructure
trees
+2
votes
1
answer
24
UGCNETJune2015II4
Consider the following statements: Depthfirst search is used to traverse a rooted tree Preorder, Postorder and Inorder are used to list the vertices of an ordered rooted tree. Huffman's algorithm is used to find an optimal binary tree with given weights Topological sorting provides a ... Which one of the above statements is true? a and b c and d a, b, and c a, b, c, and d
asked
Jul 30, 2016
in
Algorithms
by
jothee
Veteran
(
98.5k
points)

541
views
ugcnetjune2015ii
trees
treetraversal
+3
votes
2
answers
25
UGCNETDec2014II02
A certain tree has two vertices of degree $4$, one vertex of degree $3$ and one vertex of degree $2$. If the other vertices have degree $1$, how many vertices are there in the graph ? $5$ $n – 3$ $20$ $11$
asked
Jul 15, 2016
in
Others
by
makhdoom ghaya
Boss
(
40k
points)

1.8k
views
ugcnetdec2014ii
datastructure
trees
0
votes
1
answer
26
UGCNETDec2012II33
Consider the tree given below: Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree: d & h c & k g, b, c, h, i, m c & h
asked
Jul 11, 2016
in
DS
by
jothee
Veteran
(
98.5k
points)

636
views
ugcnetdec2012ii
datastructure
trees
+3
votes
2
answers
27
UGCNETDec2012II16
In which tree, for every node the height of its left subtree and right subtree differ almost by 1? Binary Search Tree AVL Tree Threaded Binary Tree Complete Binary Tree
asked
Jul 8, 2016
in
DS
by
jothee
Veteran
(
98.5k
points)

1.2k
views
ugcnetdec2012ii
datastructure
trees
binarytree
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
IISc CSA and CDCS written test and interview Experince
IIIT Hyderabad Interview Experience
My failure, Oh wait SUCCESS journey
ALGORITHMS CHECKLIST:
A Failure who got into IISc
Follow @csegate
Gatecse
Recent questions tagged trees
Recent Blog Comments
Sir I didn't get an email for GO classroom, ...
any one with marks less than 125 selected?
Thank you @Arjun Sir, @NamitaAIR1, @Priyanka, ...
Your story is very inspiring for the boys like me ...
So you completed your Btech in 5 yrs? How could ...
36,194
questions
43,647
answers
124,091
comments
42,931
users