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
+4
votes
1
answer
1
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
(
108k
points)

155
views
cmi2012
graphtheory
trees
+3
votes
0
answers
2
Total running time of 'm' access operation in a Splay tree .. [GATEFORUMTESTDSA]
asked
Nov 27, 2015
in
DS
by
Vinay Yadav
Loyal
(
3.7k
points)

216
views
datastructure
trees
+14
votes
4
answers
3
TIFR2012B15
Let $T$ be a tree of $n$ nodes. Consider the following algorithm, that constructs a sequence of leaves $u_{1}, u_{2}...$. Let $u_{1}$ be some leaf of tree. Let $u_{2}$be a leaf that is farthest from $u_{1}$. Let $u_{3}$ ... For the same tree, the distance between the last two vertices visited can be different, based on the choice of the first leaf $u_{1}$.
asked
Nov 3, 2015
in
DS
by
makhdoom ghaya
Veteran
(
47.8k
points)

483
views
tifr2012
datastructure
trees
+10
votes
1
answer
4
TIFR2011B33
Which of the following is NOT a sufficient and necessary condition for an undirected graph $G$ to be a tree? $G$ is connected and has $n 1$ edges. $G$ is acyclic and connected. $G$ is acyclic and has $n  1$ edges. $G$ is acyclic, connected and has $n  1$ edges. $G$ has $n  1$ edges.
asked
Oct 23, 2015
in
Graph Theory
by
makhdoom ghaya
Veteran
(
47.8k
points)

354
views
tifr2011
graphtheory
trees
+5
votes
1
answer
5
UGCNETDec2013II36
How many edges are there in a forest of ttrees containing a total of n vertices ? n + t n – t n ∗ t nt
asked
Jun 26, 2015
in
Graph Theory
by
Shimpy Goyal
Active
(
1.2k
points)

658
views
ugcnetdec2013ii
datastructure
trees
+12
votes
1
answer
6
GATE1994_5
A $3\text{ary}$ tree is a tree in which every internal node has exactly three children. Use induction to prove that the number of leaves in a $3\text{ary}$ tree with $n$ internal nodes is $2(n1)$.
asked
Oct 6, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

537
views
gate1994
datastructure
trees
proof
+24
votes
2
answers
7
GATE2014341
Consider the pseudocode given below. The function $DoSomething()$ takes as argument a pointer to the root of an arbitrary tree represented by the $leftMostChildrightSibling$ representation. Each node of the tree is of type $treeNode$. typedef struct ... the tree. number of nodes without a right sibling in the tree. number of leaf nodes in the tree
asked
Sep 28, 2014
in
DS
by
jothee
Veteran
(
108k
points)

2.7k
views
gate20143
datastructure
trees
normal
+20
votes
5
answers
8
GATE2014312
Consider the following rooted tree with the vertex labeled $P$ as the root: The order in which the nodes are visited during an inorder traversal of the tree is $SQPTRWUV$ $SQPTUWRV$ $SQPTWUVR$ $SQPTRUWV$
asked
Sep 28, 2014
in
DS
by
jothee
Veteran
(
108k
points)

2k
views
gate20143
datastructure
trees
easy
+13
votes
1
answer
9
GATE1998_21
Derive a recurrence relation for the size of the smallest AVL tree with height $h$. What is the size of the smallest AVL tree with height $8$?
asked
Sep 26, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

648
views
gate1998
datastructure
trees
descriptive
numericalanswers
+17
votes
7
answers
10
GATE1998_2.11
A complete $n$ary tree is one in which every node has $0$ or $n$ sons. If $x$ is the number of internal nodes of a complete $n$ary tree, the number of leaves in it is given by $x(n1) +1$ $xn1$ $xn +1$ $x(n+1)$
asked
Sep 26, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

1.4k
views
gate1998
datastructure
trees
normal
+18
votes
6
answers
11
GATE1998_1.24
Which of the following statements is false? A tree with a $n$ nodes has $(n – 1)$ edges A labeled rooted binary tree can be uniquely constructed given its postorder and preorder traversal results. A complete binary tree with $n$ internal nodes has $(n + 1)$ leaves. The maximum number of nodes in a binary tree of height h is $2^{h+1}  1$
asked
Sep 26, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

1.5k
views
gate1998
datastructure
trees
normal
+14
votes
6
answers
12
GATE200536
In a complete $k$ary tree, every internal node has exactly $k$ children. The number of leaves in such a tree with $n$ internal node is: $nk$ $(n1)k + 1$ $n(k1) +1$ $n(k1)$
asked
Sep 23, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

1.8k
views
gate2005
datastructure
trees
normal
+17
votes
5
answers
13
GATE200743
A complete $nary$ tree is a tree in which each node has $n$ children or no children. Let $I$ be the number of internal nodes and $L$ be the number of leaves in a complete $nary$ tree. If $L = 41$ and $I = 10$, what is the value of $n$? $3$ $4$ $5$ $6$
asked
Sep 22, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

2.9k
views
gate2007
datastructure
trees
normal
+20
votes
2
answers
14
GATE20101
Let $G=(V, E)$ be a graph. Define $\xi(G) = \sum\limits_d i_d*d$, where $i_d$ is the number of vertices of degree $d$ in G. If $S$ and $T$ are two different trees with $\xi(S) = \xi(T)$, then $\mid S\mid = 2\mid T \mid$ $\mid S \mid = \mid T \mid  1$ $\mid S\mid = \mid T \mid$ $\mid S \mid = \mid T\mid + 1$
asked
Sep 21, 2014
in
Graph Theory
by
gatecse
Veteran
(
18k
points)

1.7k
views
gate2010
graphtheory
normal
trees
+12
votes
2
answers
15
GATE20046
Level order traversal of a rooted tree can be done by starting from the root and performing preorder traversal inorder traversal depth first search breadth first search
asked
Sep 19, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

753
views
gate2004
datastructure
trees
easy
+16
votes
6
answers
16
GATE200365
Consider the following $234$ tree (i.e., Btree with a minimum degree of two) in which each data item is a letter. The usual alphabetical ordering of letters is used in constructing the tree. What is the result of inserting $G$ in the above tree? None of the above
asked
Sep 17, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

1.9k
views
gate2003
algorithms
trees
normal
+21
votes
4
answers
17
GATE20022.9
The number of leaf nodes in a rooted tree of n nodes, with each node having $0$ or $3$ children is: $\frac{n}{2}$ $\frac{(n1)}{3}$ $\frac{(n1)}{2}$ $\frac{(2n+1)}{3}$
asked
Sep 16, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

2.2k
views
gate2002
datastructure
trees
normal
+15
votes
4
answers
18
GATE1992_02,vii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: A $23$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length. The number of internal nodes of a $23$ tree having $9$ leaves could be $4$ $5$ $6$ $7$
asked
Sep 13, 2014
in
DS
by
Kathleen
Veteran
(
69k
points)

690
views
gate1992
trees
datastructure
normal
Page:
« prev
1
2
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
isro sc 2017 2nd paper
Which college to expect?
Interview Guidance
CDAC CoursesAugust session
Counselling...
Follow @csegate
Gatecse
Recent questions tagged trees
Recent Blog Comments
Okay Thanks
i think they call everyone ith a score higher ...
@raviyogi Do you know what was the cutoff ot IIT ...
I think the exam has not yet been created.
Then why it's not appearing as a separate exam in ...
33,712
questions
40,255
answers
114,368
comments
38,883
users