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.
Recent questions tagged trees
0
votes
0
answers
1
B+ tree
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
Loyal
(
4k
points)

29
views
btree
trees
+1
vote
3
answers
2
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
(
3.9k
points)

581
views
trees
+2
votes
1
answer
3
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
(
3.9k
points)

115
views
trees
+8
votes
2
answers
4
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
Loyal
(
4.4k
points)

499
views
isi2016
graphtheory
trees
+2
votes
2
answers
5
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
(
389
points)

191
views
binarytree
trees
+13
votes
6
answers
6
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
(
332k
points)

2.2k
views
gate20171
datastructure
trees
numericalanswers
+1
vote
1
answer
7
Made EasyCBT2017Q33
asked
Jan 22, 2017
in
DS
by
Devwritt
Loyal
(
3.1k
points)

712
views
madeeasytestseries
cbt2017
datastructure
trees
+2
votes
1
answer
8
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
Boss
(
5.3k
points)

113
views
discretemathematics
engineeringmathematics
virtualgate
graphtheory
trees
+2
votes
3
answers
9
virtualgate2015 DS
What is the correct answer?
asked
Jan 12, 2017
in
DS
by
Purple
Loyal
(
4.2k
points)

200
views
virtualgate
testseries
datastructure
binarytree
trees
+1
vote
2
answers
10
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 ... $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
Veteran
(
46.5k
points)

178
views
gate1990
descriptive
datastructure
trees
+4
votes
1
answer
11
Trees
asked
Nov 22, 2016
in
DS
by
thor
Boss
(
9.4k
points)

147
views
trees
binarytree
0
votes
0
answers
12
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
Boss
(
8.7k
points)

166
views
madeeasytestseries
trees
+1
vote
1
answer
13
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
Veteran
(
13.2k
points)

143
views
trees
graphtheory
+1
vote
3
answers
14
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
Veteran
(
46.5k
points)

108
views
ugcnetjune2010ii
datastructure
trees
0
votes
1
answer
15
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
Veteran
(
46.5k
points)

302
views
ugcnetjune2010ii
datastructure
trees
+6
votes
4
answers
16
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
Veteran
(
21k
points)

363
views
trees
+3
votes
2
answers
17
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
(
106k
points)

425
views
ugcnetjune2016ii
datastructure
trees
+1
vote
1
answer
18
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
(
106k
points)

524
views
ugcnetdec2015ii
algorithms
trees
+3
votes
2
answers
19
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
(
106k
points)

668
views
ugcnetdec2015ii
datastructure
trees
+2
votes
1
answer
20
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 ... 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
(
106k
points)

371
views
ugcnetjune2015ii
trees
treetraversal
+2
votes
1
answer
21
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
Veteran
(
46.5k
points)

857
views
ugcnetdec2014ii
datastructure
trees
0
votes
1
answer
22
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
(
106k
points)

397
views
ugcnetdec2012ii
datastructure
trees
+3
votes
2
answers
23
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
(
106k
points)

882
views
ugcnetdec2012ii
datastructure
trees
binarytree
0
votes
1
answer
24
UGCNETJune2012III36
Number of binary trees formed with 5 nodes are 32 36 120 42
asked
Jul 7, 2016
in
DS
by
jothee
Veteran
(
106k
points)

806
views
ugcnetjune2012iii
datastructure
trees
0
votes
1
answer
25
UGCNETJune2012II13
Leaves of which of the following trees are at the same level? A. Binary tree B. Btree C. AVLtree D. Expression tree
asked
Jun 15, 2016
in
DS
by
shivani2010
Active
(
1.7k
points)

510
views
ugcnetjune2012ii
programming
trees
+6
votes
7
answers
26
ISRO201119
If node A has three siblings and B is parent of A, what is the degree of A? 0 3 4 5
asked
Jun 15, 2016
in
DS
by
shibu
(
61
points)

2.3k
views
isro2011
datastructure
trees
+3
votes
1
answer
27
Splay Tree
The amortized time complexity to perform ______ operation(s) in Splay trees is $O(\log n)$. Search Search and Insert Search and Delete Search, insert and delete
asked
Jun 9, 2016
in
DS
by
shivani2010
Active
(
1.7k
points)

155
views
trees
+4
votes
1
answer
28
CMI2012A02
Let $T$ be a tree on 100 vertices. Let $n_i$ be the number of vertices in $T$ which have exactly $i$ neighbors. Let $s= \Sigma_{i=1}^{100} i . n_i$ Which of the following is true? $s=99$ $s=198$ $99 \: < \: s \: < \: 198$ None of the above
asked
May 23, 2016
in
Graph Theory
by
jothee
Veteran
(
106k
points)

148
views
cmi2012
graphtheory
trees
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
Remember the guy who gave up ?
[email protected]
mistakes which i did and you should not !
All points to MugUp Under One post!
10 important suggestions.
Follow @csegate
Gatecse
Recent questions tagged trees
Recent Blog Comments
Thank you bhaiya
I didn't receive any emails, sir. I would like ...
Sahi baat h....
Needed this a lot :) Thank you :) We should not ...
Thanks you ..
32,611
questions
39,265
answers
109,687
comments
36,649
users