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
0
answers
1
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
3 days
ago
in
Programming
by
Na462
Loyal
(
8.1k
points)

8
views
datastructure
binarytree
algorithms
madeeasytestseries
+1
vote
0
answers
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
3 days
ago
in
DS
by
sripo
Active
(
1.3k
points)

22
views
algorithms
graphtheory
binarysearchtree
binarysearch
binarytree
trees
datastructure
0
votes
0
answers
3
#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
(
653
points)

38
views
binarytree
0
votes
0
answers
4
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
(
27
points)

27
views
binarytree
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.3k
points)

65
views
binarytree
trees
graphtheory
algorithms
datastructure
+2
votes
1
answer
6
#TarGATE
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
Programming & DS
by
Parth Shah
Junior
(
565
points)

66
views
gateforumtestseries
datastructure
binarytree
0
votes
0
answers
7
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.7k
points)

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

35
views
databases
binarytree
indexing
multilevel
0
votes
0
answers
9
Self doubt
asked
Nov 21, 2018
in
Programming
by
Mahbub Alam
(
189
points)

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

99
views
datastructure
binarytree
0
votes
1
answer
11
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
(
1.3k
points)

66
views
datastructure
binarytree
heap
binaryheap
0
votes
0
answers
12
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)

69
views
datastructure
binarytree
madeeasybooklet
treetraversal
0
votes
0
answers
13
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
(
26.7k
points)

35
views
datastructure
binarytree
0
votes
0
answers
14
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
(
26.7k
points)

48
views
datastructure
binarytree
0
votes
0
answers
15
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
(
14.9k
points)

51
views
datastructure
binarytree
0
votes
0
answers
16
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
(
26.7k
points)

68
views
datastructure
binarytree
0
votes
0
answers
17
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.1k
points)

59
views
datastructure
binarytree
binarysearchtree
0
votes
2
answers
18
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
(
13.5k
points)

162
views
gb2019ds2
binarytree
+1
vote
1
answer
19
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)

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

52
views
datastructure
gate
trees
empty
binary
binarytree
+1
vote
1
answer
21
MADE EASY
asked
Sep 2, 2018
in
DS
by
nag.swarna
(
245
points)

309
views
binarytree
0
votes
2
answers
22
Binary Tree Array Implementation
What must be the ideal size of array if the height of tree is ‘l’? a) 2l1 b) l1 c) l d) 2l
asked
Aug 19, 2018
in
Programming
by
pradeepchaudhary
Active
(
1k
points)

57
views
binarysearchtree
binarytree
datastructure
0
votes
1
answer
23
Binary Search Tree
8. What are the worst case and average case complexities of a binary search tree? a) O(n), O(n) b) O(logn), O(logn) c) O(logn), O(n) d) O(n), O(logn)
asked
Aug 19, 2018
in
Programming
by
pradeepchaudhary
Active
(
1k
points)

68
views
datastructure
binarysearchtree
bst
binarytree
algorithms
0
votes
1
answer
24
Program of Binary Tree
Why not this code not printing 10? (It is just a binary tree with one node i.e. root. And value of root is 10) #include <stdio.h> #include<stdlib.h> struct BinaryTree *root=NULL; struct BinaryTree{ int data; struct BinaryTree *left; struct BinaryTree * ... root=node(data1); return root; } } int main() { insert(root,10); printf("%d",*root); return 0; }
asked
Aug 14, 2018
in
DS
by
srestha
Veteran
(
106k
points)

57
views
datastructure
binarytree
binarysearchtree
+1
vote
2
answers
25
selfdoubt
Consider a binary tree T that has 50 leaf nodes. Then the number of nodes in T that have exactly ONE children are ______.
asked
Jul 25, 2018
in
DS
by
bhavnakumrawat5
(
193
points)

82
views
binarytree
0
votes
0
answers
26
#avl tree
what is the worst case possible height of an avl tree ??? https://www.geeksforgeeks.org/practicequestionsheightbalancedavltree/ how does 1.44*logn comes ????
asked
Jul 23, 2018
in
Algorithms
by
vijju532
Active
(
1.1k
points)

36
views
datastructure
binarytree
algorithms
0
votes
0
answers
27
doubttree
If each node of the Btree is 80 percent full, then what is the average number of keys per node of the above B tree?
asked
Jul 20, 2018
in
DS
by
bhavnakumrawat5
(
193
points)

48
views
binarytree
+2
votes
2
answers
28
self doutbt
How to Construct Full Binary Tree from given preorder and postorder? Thank you.
asked
Jul 16, 2018
in
DS
by
Vegeta
Junior
(
813
points)

105
views
binarytree
binarysearchtree
treetraversal
0
votes
1
answer
29
UGCNETJuly2018II25
A text is made up of the characters A, B, C, D, E each occurring with the probability 0.08, 0.40, 0.25, 0.15 and 0.12 respectively. The optimal coding will have the average length of 2.4 1.87 3.0 2.15
asked
Jul 13, 2018
in
Probability
by
Pooja Khatri
Active
(
5.1k
points)

250
views
ugcnetjuly2018ii
probability
binarytree
datastructure
0
votes
1
answer
30
Binary Tree
Can a binary tree or BST can be constructed with dynamic programming? Can it be constructed through greedy method? Plz give some algorithm and explain
asked
Jun 30, 2018
in
Algorithms
by
srestha
Veteran
(
106k
points)

63
views
binarytree
binarysearchtree
algorithms
Page:
1
2
3
4
5
6
7
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
PSU's
Decidability Slides
How to Revise?
AAI JE IT results out! Adv no 02/2018
Graph Theory Slides for GATECSE
Follow @csegate
Gatecse
Recent questions tagged binarytree
Recent Blog Comments
2 I guess.
How many mock tests are there in total?
It should be. But I dont have that test from GB...
arjun sir, TOC test(grand) will be uploaded or...
Follow the video given by sripo. it will help....
46,966
questions
51,292
answers
177,262
comments
66,643
users