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
DSATest 3Question 12
Let T = (V, E) be a tree and let d(v) be the degree of a vertex. Consider following statements: (i) P v∈V (2 − d(v)) = 2 (ii) If T has a vertex of degree m ≥ 2, then it has at least m vertices of degree 1. (iii) P v∈V (k − d(v)) = k, for k ≥ 2  k ∈ ... of the above statements is/are ture: (A) (i) only (B) (i), (ii) only (C) (ii) and (iii) only (D) (i), (ii) and (iii) only
asked
6 days
ago
in
Graph Theory
by
Sandy Sharma
Junior
(
903
points)

10
views
trees
discretemathematics
0
votes
1
answer
2
DSATest 3Question 10
For which of the following scenarios does there exist a simple graph G = (V, E) satisfying the specified conditions? (A) It has 3 components 20 vertices and 16 edges. (B) It has 10 vertices, 38 edges, and more than one component. (C) It has 7 vertices, 10 edges, and more than two components. (D) It is connected and has 10 edges 5 vertices and fewer than 6 cycles.
asked
6 days
ago
in
Graph Theory
by
Sandy Sharma
Junior
(
903
points)

15
views
trees
discretemathematics
0
votes
1
answer
3
DSATest 3Question 9
Consider following statements: (i) Every simple graph has at least two vertices of the same degree. (ii) If u is a vertex of odd degree in a graph, then there exists a path from u to another vertex v of the graph where v also has odd degree. (iii) If there are exactly ... above statements are not true? (A) (i) and (ii) only (B) (iii) only (C) (ii) only (D) None of the above
asked
6 days
ago
in
Graph Theory
by
Sandy Sharma
Junior
(
903
points)

11
views
discretemathematics
trees
0
votes
0
answers
4
DSATest 3Question 5
Consider following statements about tripartite graph, i.e. TPG, which contains three subsets of vertices of graph as A,B and C: (i) Minimum number of edges in a cycle in a TPG which passes through all three subsets of vertices is 6. (ii) A complete TPG can be colored with atmost 3 ... are true: (A) (i) only (B) (iii) only (C) (ii) and (iii) only (D) (i) and (ii) only
asked
6 days
ago
in
Graph Theory
by
Sandy Sharma
Junior
(
903
points)

5
views
trees
discretemathematics
0
votes
1
answer
5
DSATest 3Question 3
A quinpartite graph is a graph whose vertices can be partitioned into five groups such that no two vertices in same group are connected via some edge. The maximum number of edges in a quinpartite graph with 10 vertices, where cardinalities of those five sets are given as {2,3,2,1,2}, is: (A) 16 (B) 20 (C) 26 (D) 39
asked
6 days
ago
in
Graph Theory
by
Sandy Sharma
Junior
(
903
points)

11
views
trees
0
votes
1
answer
6
madeeasy
which is an efficient tree structure in terms of space and time complexity? a) AVL Tree b)Full Binary tree c)Complete binary tree d)Binary tree
asked
Aug 4
in
DS
by
manvi_agarwal
(
109
points)

37
views
datastructure
trees
0
votes
0
answers
7
compile design question from runtime environment
asked
Apr 16
in
Compiler Design
by
Ronish Jariwala 1
(
87
points)

56
views
runtimeenvironments
compilerdesign
hashing
trees
0
votes
0
answers
8
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
(
7.2k
points)

132
views
graphtheory
discretemathematics
trees
0
votes
2
answers
9
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
(
18.1k
points)

97
views
uttarakhandasstprof2018
datastructure
trees
0
votes
1
answer
10
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)

97
views
btree
datastructure
trees
+1
vote
1
answer
11
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.6k
points)

93
views
btree
trees
bplustrees
+5
votes
4
answers
12
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
(
8k
points)

874
views
trees
+2
votes
1
answer
13
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
(
8k
points)

216
views
trees
+10
votes
2
answers
14
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)

706
views
isi2016
graphtheory
trees
descriptive
+3
votes
3
answers
15
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)

248
views
binarytree
trees
+19
votes
6
answers
16
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
(
358k
points)

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

836
views
madeeasytestseries
cbt2017
datastructure
trees
+2
votes
1
answer
18
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.9k
points)

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

273
views
virtualgate
testseries
datastructure
binarytree
trees
+2
votes
2
answers
20
GATE199013a
Consider the heightbalanced tree $T_{t}$ with values stored at only the leaf nodes, shown in Fig.4. 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}$. Fig. 5 (ii) What is the ... $T_{2}$ 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
(
40.2k
points)

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

195
views
trees
binarytree
0
votes
0
answers
22
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.9k
points)

204
views
madeeasytestseries
trees
+1
vote
1
answer
23
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.4k
points)

174
views
trees
graphtheory
+1
vote
3
answers
24
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
(
40.2k
points)

237
views
ugcnetjune2010ii
datastructure
trees
+1
vote
1
answer
25
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
(
40.2k
points)

588
views
ugcnetjune2010ii
datastructure
trees
+6
votes
4
answers
26
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.6k
points)

448
views
trees
+3
votes
3
answers
27
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
(
101k
points)

1.1k
views
ugcnetjune2016ii
datastructure
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
kvs pgt
Algorithms GO Classroom
Programming and DS GO Classroom
Discrete Mathematics GO Classroom
Digital Logic GO Classroom
Follow @csegate
Gatecse
Recent questions tagged trees
Recent Blog Comments
@Arjun sir how to remove such post? should i hide...
[email protected]
.Plz do share @Sanjay sharma
Please post it as question
This is blog area post it as question
[email protected]
39,778
questions
46,781
answers
140,753
comments
58,674
users