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 binarytree
+2
votes
3
answers
1
ISRO202023
The postorder traversal of binary tree is $ACEDBHIGF$. The preorder traversal is $ABCDEFGHI$ $FBADCEGIH$ $FABCDEGHI$ $ACDEFGIH$
asked
Jan 13
in
DS
by
Satbir
Boss
(
24.2k
points)

230
views
isro2020
datastructures
binarytree
normal
+1
vote
0
answers
2
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, 2019
in
Algorithms
by
Kushagra गुप्ता
Active
(
4.5k
points)

170
views
cormen
algorithms
descriptive
binarysearchtree
binarytree
trees
+1
vote
2
answers
3
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
May 22, 2019
in
DS
by
srestha
Veteran
(
119k
points)

187
views
madeeasytestseries
binarytree
0
votes
0
answers
4
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, 2019
in
Algorithms
by
srestha
Veteran
(
119k
points)

73
views
binarytree
madeeasytestseries
+2
votes
1
answer
5
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, 2019
in
Programming
by
manikgupta123
(
81
points)

195
views
iiithpgee
binarytree
timecomplexity
0
votes
0
answers
6
self doubt
somewhere we seen that formula How many binary tree possible without labeled =c(2n,n)/n+1. anybody explain how we get this formula.
asked
Feb 23, 2019
in
DS
by
sandeep singh gaur
(
307
points)

75
views
binarytree
+15
votes
7
answers
7
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, 2019
in
DS
by
Arjun
Veteran
(
431k
points)

6.8k
views
gate2019
numericalanswers
datastructures
binarytree
0
votes
2
answers
8
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, 2019
in
Databases
by
HeartBleed
Active
(
1k
points)

491
views
databases
binarytree
0
votes
1
answer
9
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, 2019
in
DS
by
Ram Swaroop
Loyal
(
5.4k
points)

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

96
views
datastructures
binarytree
0
votes
0
answers
11
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, 2019
in
Programming
by
Na462
Loyal
(
7k
points)

65
views
datastructures
binarytree
algorithms
madeeasytestseries
+2
votes
1
answer
12
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, 2019
in
DS
by
sripo
Active
(
2.5k
points)

547
views
algorithms
graphtheory
binarysearchtree
binarysearch
binarytree
trees
datastructures
+1
vote
1
answer
13
#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, 2019
in
DS
by
amit166
Junior
(
775
points)

73
views
binarytree
0
votes
0
answers
14
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, 2019
in
DS
by
Prince Sindhiya
Loyal
(
5.9k
points)

89
views
zeal
datastructures
binarytree
zeal2019
0
votes
0
answers
15
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
(
33
points)

111
views
binarytree
+1
vote
1
answer
16
GO2019FLT149
The path length of a node is defined as the number of edges from root to that node. For a given full binary tree, the sum of path length of all leaf nodes is equal to $16$. The total number of internal nodes present is equal to $5$. What is the sum of path length of all internal nodes? (Note: A full binary tree is a tree in which every node other than the leaves has 2 children)
asked
Dec 27, 2018
in
DS
by
Ruturaj Mohanty
Active
(
2.7k
points)

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

140
views
madeeasytestseries
datastructures
binarytree
0
votes
2
answers
18
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.5k
points)

438
views
binarytree
trees
graphtheory
algorithms
datastructures
+2
votes
2
answers
19
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
(
745
points)

121
views
gateforumtestseries
datastructures
binarytree
0
votes
1
answer
20
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
(
217
points)

143
views
madeeasytestseries
datastructures
binarytree
0
votes
0
answers
21
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.2k
points)

207
views
datastructures
binarytree
0
votes
1
answer
22
B+ Trees
can anyone share some good resources fot B+ tree deletion?
asked
Nov 23, 2018
in
Databases
by
aditi19
Loyal
(
5.2k
points)

76
views
databases
binarytree
indexing
multilevel
0
votes
0
answers
23
Self doubt
asked
Nov 21, 2018
in
Programming
by
Mahbub Alam
(
205
points)

40
views
datastructures
binarytree
0
votes
0
answers
24
Tree Traversal
asked
Nov 20, 2018
in
Programming
by
Na462
Loyal
(
7k
points)

360
views
datastructures
binarytree
0
votes
1
answer
25
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.5k
points)

97
views
datastructures
binarytree
heap
binaryheap
0
votes
0
answers
26
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
(
21
points)

204
views
datastructures
binarytree
madeeasybooklet
treetraversal
0
votes
0
answers
27
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
Veteran
(
59.3k
points)

173
views
datastructures
binarytree
0
votes
0
answers
28
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
Veteran
(
59.3k
points)

76
views
datastructures
binarytree
0
votes
0
answers
29
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
(
16.4k
points)

66
views
datastructures
binarytree
0
votes
0
answers
30
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
Veteran
(
59.3k
points)

101
views
datastructures
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
ISRO CSE 2020 PAPER ANALYSE
BARC OCES/DGFS 2020
ISI CMI PDF by GATE Overflow
Calculus Important Points
Management Trainee Recruitment COAL INDIA 2020
Follow @csegate
Recent questions tagged binarytree
Recent Blog Comments
Has anyone else challenged the questions on...
@nkg_master9  For getting selected for the...
Nowhere it's mentioned.
@bond  Is it mentioned that you have to score at...
I think cutoff won't cross 85
50,737
questions
57,385
answers
198,548
comments
105,361
users