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 binarytree
0
votes
1
answer
1
Made Easy Test Series:Binary Trees
Consider the following function height, to which pointer to the root node of a binary tree shown below is passed Note that max(a,b) defined by #define max(a,b) (a>b)?a:b. int height(Node *root) The output of the above code will be _________________
asked
4 days
ago
in
DS
by
srestha
Veteran
(
114k
points)

27
views
madeeasytestseries
binarytree
0
votes
0
answers
2
Made Easy Test Series: Binary Tree
The number of node in each left subtree is within a factor of $2.$ of the number of nodes in the corresponding right subtree. Also a node allowed to have only one child if that child has no children. This tree has worst case height $O(logn)$. $N$ is the number of nodes in the binary tree. Is this statement TRUE about Binary Tree?
asked
May 7
in
Algorithms
by
srestha
Veteran
(
114k
points)

16
views
binarytree
madeeasytestseries
+2
votes
1
answer
3
IIIT PGEE 2019
What is the time complexity for insertion in binary tree in worst case? O(1) O(log n) O(n) O(n log n)
asked
Apr 29
in
Programming
by
manikgupta123
(
115
points)

118
views
iiithpgee
binarytree
timecomplexity
+4
votes
6
answers
4
GATE201946
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.
asked
Feb 7
in
DS
by
Arjun
Veteran
(
400k
points)

4.6k
views
gate2019
numericalanswers
datastructure
binarytree
0
votes
2
answers
5
Gate 2019: B+ Tree
Which of the following is not correct about B + Tree, which is used for creating index of relational database table? (a) Key values in each node kept in sorted order (b) Leaf node pointer points to next node (c) B + tree is height balanced tree (d) Nonleaf node have pointers to data records
asked
Feb 4
in
Databases
by
HeartBleed
(
489
points)

315
views
databases
binarytree
0
votes
1
answer
6
Made easy tree height
The height of a binary tree is defined as the number of nodes in the longest path from root to the leaf node. Let X be the height of a complete binary tree with 256 nodes. Then the value of X will be Answer 9
asked
Jan 28
in
DS
by
Ram Swaroop
Active
(
2.7k
points)

74
views
datastructure
binarytree
0
votes
0
answers
7
Binary Tree
I think its answer is 8 .Please ,can any one make it sure for me :)
asked
Jan 25
in
DS
by
Nandkishor3939
Active
(
1.2k
points)

72
views
datastructure
binarytree
0
votes
0
answers
8
Binary tree
Consider a binary tree for every node  P  Q  <= 2. P represents number of nodes in left subtree of S and Q represents number of nodes in right subtree of S for h > 0. The minimum number of nodes present in such tree of height h = 4 ( Root at 0 level)
asked
Jan 16
in
Programming
by
Na462
Loyal
(
8.7k
points)

47
views
datastructure
binarytree
algorithms
madeeasytestseries
+2
votes
1
answer
9
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.6k
points)

212
views
algorithms
graphtheory
binarysearchtree
binarysearch
binarytree
trees
datastructure
0
votes
0
answers
10
#bst tree
The number of BST possible with 6 node numbered 1,2,3,4,5 and 6 with exactly one leaf node
asked
Jan 5
in
DS
by
amit166
Junior
(
743
points)

48
views
binarytree
0
votes
0
answers
11
Zeal Test Series 2019: Programming & DS  Binary Tree
A full binary tree is a tree in which every node other than the leaves has two children. If there are 600 leaves then total number of leaf nodes are?
asked
Jan 2
in
DS
by
Prince Sindhiya
Loyal
(
6.3k
points)

48
views
zeal
datastructure
binarytree
zeal2019
0
votes
0
answers
12
https://www.geeksforgeeks.org/datastructuregq/binarytreesgq/
A weightbalanced tree is a binary tree in which for each node. The number of nodes in the left sub tree is at least half and at most twice the number of nodes in the right sub tree. The maximum possible height (number of nodes on ... ) of such a tree on n nodes is best described by which of the following? a) b) c) d) Binary Trees
asked
Dec 30, 2018
in
Programming
by
ayush201
(
37
points)

63
views
binarytree
0
votes
1
answer
13
MadeEasy Test Series: Programming & DS  Binary Tree
asked
Dec 26, 2018
in
DS
by
Shamim Ahmed
Active
(
2.5k
points)

99
views
madeeasytestseries
datastructure
binarytree
0
votes
1
answer
14
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.6k
points)

208
views
binarytree
trees
graphtheory
algorithms
datastructure
+2
votes
2
answers
15
Gateforum Test Series: Programming & DS  Binary Tree
Suppose binary tree has only three nodes A,B and C, and you are given the post order traversal of tree as BAC . The exact pre order traversal of the tree is? A)CAB B)ABC C)CBA D)Can't be determined from given information.
asked
Dec 11, 2018
in
DS
by
Parth Shah
Junior
(
699
points)

95
views
gateforumtestseries
datastructure
binarytree
0
votes
1
answer
16
MadeEasy Subject Test 2019: Programming & DS  Binary Tree
four vertices {A,B,C,D} is given which has only vertex D as a leaf total number of binary tree are possible when every binary tree has four node!
asked
Dec 10, 2018
in
DS
by
CHïntän ÞäTël
(
285
points)

111
views
madeeasytestseries
datastructure
binarytree
0
votes
0
answers
17
binary tree
Consider a binary tree, where for every node $PQ\leq 2$.Prepresent number of nodes in left sub tree for node S and Q represents the number of nodes in right sub tree for node S for $h>0$. The minimum number of node present in such binary tree of height $h=4$ _____________ Im getting 8. kindly verify
asked
Dec 4, 2018
in
Programming
by
Pawan Kumar 2
Active
(
4.8k
points)

139
views
datastructure
binarytree
0
votes
1
answer
18
B+ Trees
can anyone share some good resources fot B+ tree deletion?
asked
Nov 23, 2018
in
Databases
by
aditi19
Active
(
3.8k
points)

48
views
databases
binarytree
indexing
multilevel
0
votes
0
answers
19
Self doubt
asked
Nov 21, 2018
in
Programming
by
Mahbub Alam
(
199
points)

34
views
datastructure
binarytree
0
votes
0
answers
20
Tree Traversal
asked
Nov 20, 2018
in
Programming
by
Na462
Loyal
(
8.7k
points)

121
views
datastructure
binarytree
0
votes
1
answer
21
How to understand difference between n/2 and log(n) when comes to operations on a binary tree
asked
Nov 8, 2018
in
DS
by
sripo
Active
(
2.6k
points)

79
views
datastructure
binarytree
heap
binaryheap
0
votes
0
answers
22
Made Easy Booklet
Suppose a binary tree has only three nodes A, B and C and you are given that the postorder traversal for the tree is BAC. The exact preorder traversal for the tree is. CAB ABC CBA A definite preorder traversal cannot be determined from the information given
asked
Nov 6, 2018
in
DS
by
shgarg
(
31
points)

93
views
datastructure
binarytree
madeeasybooklet
treetraversal
0
votes
0
answers
23
Red Black Tree
What is the largest possible number of internal nodes in a redblack tree with black height $4?$
asked
Oct 28, 2018
in
DS
by
Lakshman Patel RJIT
Boss
(
36.4k
points)

75
views
datastructure
binarytree
0
votes
0
answers
24
Binary tree
Assume that there is at most $1$ node at height $0$ then a binary tree with $7$ node: $1)$ Has Exactly $8$ edges $2)$ The height of this binary tree is at least $2$ and at most $6$ $3)$ The depth of the root node is zero Which of the above statement are true? $A)1$ $B)3$ $C)2 $ and $3$ $D)1 $ and $ 2$
asked
Oct 27, 2018
in
DS
by
Lakshman Patel RJIT
Boss
(
36.4k
points)

54
views
datastructure
binarytree
0
votes
0
answers
25
Binary Tree
I know the answer. But is there any general FORMULA for it? If yes, please provide the complete derivation of it. In the solution, they used $\rightarrow 2^{h1}+1.$ I tried but I am not able to derive it.
asked
Oct 22, 2018
in
Programming
by
Soumya29
Boss
(
15.5k
points)

55
views
datastructure
binarytree
0
votes
0
answers
26
Binary tree traversal
find the vertical sum of a binary tree. For example,the tree has 5 vertical lines?
asked
Oct 22, 2018
in
DS
by
Lakshman Patel RJIT
Boss
(
36.4k
points)

79
views
datastructure
binarytree
0
votes
0
answers
27
Labelled Binary Tree
Consider 4 labeled 1,2,3,4. The number of distinct binary tree possible such that whose inorder traversal is 1,2,3,4 are ........
asked
Oct 20, 2018
in
Programming
by
Na462
Loyal
(
8.7k
points)

77
views
datastructure
binarytree
binarysearchtree
0
votes
2
answers
28
GATEBOOK2019DS27
In a binary tree with $n$ nodes, every nonleaf node has an even number of descendants. Every node is considered to be its own descendant. What is the number of nodes in a tree that has exactly one child? $0$ $1$ $\frac{(n  1)}{2}$ $n1$
asked
Oct 16, 2018
in
Programming
by
GATEBOOK
Boss
(
17.3k
points)

247
views
gb2019ds2
binarytree
+1
vote
1
answer
29
Binary tree
A. Total no. of trees that were there in the forest. B. Total no. of nodes in the forest. C. Total no. of nodes which have only right child. D. Return max element among all nodes.
asked
Sep 28, 2018
in
Programming
by
Vaishnavi01
(
217
points)

64
views
datastructure
binarytree
0
votes
0
answers
30
Data structures
asked
Sep 28, 2018
in
Programming
by
Vaishnavi01
(
217
points)

71
views
datastructure
trees
empty
binary
binarytree
Page:
1
2
3
4
5
6
...
8
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
IISc Intelligent Systems RA interview experience
COAP Round 2 may begin at 5PM Today
IIT Kanpur MS Interview experience
My GATE preparation and what you can learn from it
IIT Bombay RA (2019) Programming Questions
Follow @csegate
Recent questions tagged binarytree
Recent Blog Comments
Rank 464. OBC
Thanks for sharing your exp Naveen and congrats...
what is cross word question exactly
how you prepared for such tricky questions
please anyone who has idea of this reply
49,456
questions
53,658
answers
186,156
comments
70,919
users