The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
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
Recent questions tagged trees
+1
vote
0
answers
1
Cormen Edition 3 Exercise 12.1 Question 5 (Page No. 289)
Argue that since sorting $n$ elements takes $\Omega (n\ lgn)$ time in the worst case in the comparison model, any comparisonbased algorithm for constructing a $BST$ from an arbitrary list of n elements takes $\Omega (n\ lgn)$ time in the worst case.
asked
Nov 20
in
Algorithms
by
Kushagra गुप्ता
Active
(
1.9k
points)

76
views
cormen
algorithms
descriptive
binarysearchtree
binarytree
trees
+1
vote
1
answer
2
CMI2019A3
Suppose that the figure to the right is a binary search tree. The letters indicate the names of the nodes, not the values that are stored. What is the predecessor node, in terms of value, of the root node $A?$ $D$ $H$ $I$ $M$
asked
Sep 13
in
DS
by
gatecse
Boss
(
16.8k
points)

68
views
cmi2019
datastructure
trees
binarysearchtree
+2
votes
1
answer
3
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
(
2.4k
points)

433
views
algorithms
graphtheory
binarysearchtree
binarysearch
binarytree
trees
datastructure
0
votes
0
answers
4
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)

35
views
databases
btree
trees
0
votes
0
answers
5
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
(
7.3k
points)

78
views
programminginc
trees
0
votes
2
answers
6
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
(
2.4k
points)

388
views
binarytree
trees
graphtheory
algorithms
datastructure
0
votes
0
answers
7
Data structures
asked
Sep 28, 2018
in
Programming
by
Vaishnavi01
(
143
points)

105
views
datastructure
trees
empty
binary
binarytree
+1
vote
1
answer
8
ISI2016PCBCS1
Consider the array $A=[20,13,19,8,3,5,4]$ that represents a heap. Draw the heap after removing the element $20.$ List all the distinct integer keys $k$ such that, when $k$ is inserted in the Binary Search Tree of Figure $1,$ its height increases. Note that you are not allowed to insert an already existing key again. Justify your answer.
asked
Sep 18, 2018
in
DS
by
jothee
Veteran
(
105k
points)

35
views
isi2016pcbcs
trees
binarysearchtree
descriptive
0
votes
0
answers
9
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.2k
points)

65
views
trees
discretemathematics
+1
vote
1
answer
10
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.2k
points)

127
views
trees
discretemathematics
0
votes
1
answer
11
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.2k
points)

217
views
discretemathematics
trees
0
votes
0
answers
12
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.2k
points)

48
views
trees
discretemathematics
+1
vote
1
answer
13
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.2k
points)

96
views
trees
+2
votes
1
answer
14
MadeEasy Subject Test 2019: Programming & DS  Binary Tree
asked
Sep 2, 2018
in
DS
by
nag.swarna
(
177
points)

648
views
trees
programming
datastructure
madeeasytestseries2019
madeeasytestseries
+1
vote
1
answer
15
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
(
105
points)

107
views
datastructure
trees
+1
vote
2
answers
16
Made Easy test series DS
The number of binary search trees possible with 12 keys, when keys 1, 2, 3, 4, ........ 12 are inserted into empty Binary Search Tree with condition such that 4 is the root of binary search tree and 8 is immediate right child of 4 are ________.
asked
Jul 27, 2018
in
DS
by
Sambhrant Maurya
Active
(
3.4k
points)

170
views
combinatory
trees
0
votes
2
answers
17
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
Boss
(
10.8k
points)

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

93
views
runtimeenvironments
compilerdesign
hashing
trees
0
votes
0
answers
19
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
Boss
(
16.3k
points)

236
views
graphtheory
discretemathematics
trees
0
votes
2
answers
20
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
(
16.8k
points)

135
views
uttarakhandasstprof2018
datastructure
trees
0
votes
1
answer
21
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
(
7
points)

127
views
btree
datastructure
trees
0
votes
0
answers
22
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
(
25.3k
points)

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

159
views
btree
trees
bplustrees
0
votes
1
answer
24
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
(
493
points)

205
views
madeeasytestseries
datastructure
trees
treetraversal
+1
vote
2
answers
25
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
(
339
points)

103
views
madeeasytestseries
datastructure
trees
+5
votes
4
answers
26
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
Veteran
(
54.7k
points)

1.3k
views
trees
+2
votes
1
answer
27
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
Veteran
(
54.7k
points)

295
views
trees
+1
vote
0
answers
28
apset2017 paper2
A 23 tree is a tree such that (i) All the internal nodes have either 2 or 3 children (ii) All paths from root to the leaves have the same length The number of internal nodes of 23 tree having 9 leaves could be (A) 4 (B) 5 (C) 6 (D) 8
asked
Aug 2, 2017
in
DS
by
Knn
(
11
points)

109
views
trees
0
votes
1
answer
29
How to find preorder predecessor,preorder successor, postorder predecessor and postorder successor
asked
Apr 14, 2017
in
Algorithms
by
Snigdha Mandal
(
9
points)

630
views
datastructure
treetraversal
trees
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
Linear Algebra Important Points
GATE 2020
OFFICIAL GATE MOCK TEST RELEASED
IIITH: Winter Research Admissions 2019 (For Spring 2020)
TIFR and JEST exam
Follow @csegate
Recent questions tagged trees
Recent Blog Comments
i also don't have any pdf, actually, I added the...
i don't have , if you have upload it
@mohan123 Do you have all standard book...
bro can be upload all standard book questions in...
it'll take 34 days but for most purpose you can...
50,648
questions
56,457
answers
195,313
comments
100,147
users