The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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 trees
+1
vote
0
answers
1
GATEBOOK2019 Mock Test113
A $kary$ tree is a tree in which every node has at most $k$ children. In a $kary$ tree with $n$ nodes and height $h,$ which of the following is an upper bound for the maximum number of leaves as a function of $h, k,$ and $n?$ $\log_{k}n$ $\log_{k}h$ $\frac{n}{\log_{k}n}$ $k^{h}$
asked
Jan 19
in
DS
by
GATEBOOK
Boss
(
15.3k
points)

105
views
gb2019mock1
trees
+2
votes
1
answer
2
How many Binary Search Trees are possible for a labelled nodes?
Let us there are n nodes which are labelled. Then the number of trees possible is given by the Catalan Number i.e $\binom{2n}{n} / (n+1)$ Then the binary search trees possible is just 1?
asked
Jan 16
in
DS
by
sripo
Active
(
1.5k
points)

109
views
algorithms
graphtheory
binarysearchtree
binarysearch
binarytree
trees
datastructure
0
votes
0
answers
3
self doubt
For range queries every B+ tree index requires less I/O than a full table scan. can anyone explain?
asked
Jan 2
in
Databases
by
newdreamz a1z0
Active
(
1.6k
points)

18
views
databases
btree
trees
0
votes
0
answers
4
Self Doubt
Leaf Nodes =[ Internal nodes with degree 2 ] + 1 It is valid if we consider Tree as undirected graph ? Or is it valid only for Tree when considered as directed graph
asked
Dec 29, 2018
in
DS
by
jatin khachane 1
Loyal
(
6.4k
points)

61
views
programminginc
trees
0
votes
1
answer
5
In a 3array tree if internal nodes have exactly 3 children,the number of leaf nodes will be __ ?
asked
Dec 25, 2018
in
DS
by
sripo
Active
(
1.5k
points)

110
views
binarytree
trees
graphtheory
algorithms
datastructure
0
votes
0
answers
6
Data structures
asked
Sep 28, 2018
in
Programming
by
Vaishnavi01
(
217
points)

58
views
datastructure
trees
empty
binary
binarytree
0
votes
0
answers
7
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
Sep 18, 2018
in
Graph Theory
by
Sandy Sharma
Active
(
1.3k
points)

51
views
trees
discretemathematics
0
votes
1
answer
8
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
Sep 18, 2018
in
Graph Theory
by
Sandy Sharma
Active
(
1.3k
points)

85
views
trees
discretemathematics
0
votes
1
answer
9
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
Sep 18, 2018
in
Graph Theory
by
Sandy Sharma
Active
(
1.3k
points)

117
views
discretemathematics
trees
0
votes
0
answers
10
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
Sep 18, 2018
in
Graph Theory
by
Sandy Sharma
Active
(
1.3k
points)

32
views
trees
discretemathematics
0
votes
1
answer
11
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
Sep 18, 2018
in
Graph Theory
by
Sandy Sharma
Active
(
1.3k
points)

78
views
trees
+1
vote
1
answer
12
MadeEasy Subject Test 2019: Programming & DS  Binary Tree
asked
Sep 2, 2018
in
DS
by
nag.swarna
(
235
points)

473
views
trees
programming
datastructure
madeeasytestseries2019
madeeasytestseries
+1
vote
1
answer
13
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, 2018
in
DS
by
manvi_agarwal
(
139
points)

75
views
datastructure
trees
0
votes
1
answer
14
UGCNETJuly2018II29
A 5ary tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes will be: 30 33 45 125
asked
Jul 13, 2018
in
Others
by
Pooja Khatri
Loyal
(
8.9k
points)

790
views
ugcnetjuly2018ii
datastructure
trees
0
votes
0
answers
15
compile design question from runtime environment
asked
Apr 16, 2018
in
Compiler Design
by
Ronish Jariwala 1
(
87
points)

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

167
views
graphtheory
discretemathematics
trees
0
votes
2
answers
17
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, 2018
in
Others
by
gatecse
Boss
(
18.3k
points)

114
views
uttarakhandasstprof2018
datastructure
trees
0
votes
1
answer
18
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, 2018
in
Algorithms
by
Mathews George
(
15
points)

114
views
btree
datastructure
trees
0
votes
0
answers
19
MadeEasy Test Series: Programming & DS  Trees
True / False: 1. : The difference between the number of nodes in a binary tree that have exactly two children and the number of leaf nodes is 1 2. Deletion of root of AVL tree will take O(n) time so that, resulted tree also have property of ... is correct as we can do in logn so o(n) is also correct. Given answer is : 1 is true and second is false.
asked
Dec 7, 2017
in
DS
by
rahul sharma 5
Boss
(
26.8k
points)

118
views
madeeasytestseries
datastructure
algorithms
trees
+1
vote
1
answer
20
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.7k
points)

132
views
btree
trees
bplustrees
0
votes
1
answer
21
MadeEasy Test Series: Programming & DS  Trees
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder traversal.?? how to find it ?
asked
Dec 7, 2017
in
Programming
by
aaru14
Junior
(
825
points)

139
views
madeeasytestseries
datastructure
trees
treetraversal
+1
vote
1
answer
22
MadeEasy Subject Test: Programming & DS  Trees
A 4ary tree,i.e. each node has either 0 or 4 children tree has 20 leaf nodes. Then the total number of nodes in the tree are ____.
asked
Nov 13, 2017
in
DS
by
Hardik Vagadia
(
495
points)

76
views
madeeasytestseries
datastructure
trees
+5
votes
4
answers
23
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
Boss
(
29.4k
points)

1.1k
views
trees
+2
votes
1
answer
24
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
Boss
(
29.4k
points)

246
views
trees
+11
votes
2
answers
25
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.4k
points)

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

280
views
binarytree
trees
+21
votes
7
answers
27
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
(
386k
points)

3.8k
views
gate20171
datastructure
trees
numericalanswers
+1
vote
1
answer
28
MadeEasy CBT 2017: Programming & DS  Trees
asked
Jan 22, 2017
in
DS
by
Devwritt
Active
(
4.2k
points)

986
views
madeeasytestseries
cbt2017
datastructure
trees
+1
vote
1
answer
29
MadeEasy Subject Test: Algorithms  Time Complexity
A program takes input of a binary tree with N nodes and computes a function f(x)=max height of left subtreemax height of right subtree what is the time complexity?
asked
Jan 20, 2017
in
Algorithms
by
Aboveallplayer
Boss
(
18.7k
points)

221
views
madeeasytestseries
datastructure
trees
algorithms
timecomplexity
Page:
1
2
3
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 Gandhinagar review
Is DAIICT good for doing MTech ?
AIR175 : GO is enough
GATE 2019 My reasoned routine. (AIR 558)
if i can you also can
Follow @csegate
Recent questions tagged trees
Recent Blog Comments
congrats man!!! u surely need guts to leave job...
You won't get M.Tech degree then
I have generic query , not just about iit gn but...
Thank you Abhishek
Heartliest Congratulation Abhishek Bhai. This was...
48,515
questions
52,763
answers
183,377
comments
68,234
users