Dark Mode

Recent questions tagged binary-tree

3 votes

0 answers

151

DS TREES
Consider a binary tree T that has 150 leaf nodes. Then the number of TOTAL nodes in T that have exactly two children are ______.

iarnav asked in DS Jan 7, 2018

by iarnav

1.0k views

–2 votes

0 answers

152

DS BINARY TREE
Consider a binary tree T that has 100 leaf nodes. Then the number of nodes in T that have exactly ONE children are ______.

iarnav asked in DS Jan 7, 2018

by iarnav

398 views

1 vote

1 answer

153

DS BINARY TREE
Consider a binary tree T that has 100 leaf nodes. Then the number of INTERNAL nodes in T that have exactly two children are ______.

iarnav asked in DS Jan 7, 2018

by iarnav

1.5k views

–1 vote

1 answer

154

DS COMPLETE BINARY TREE
IS IT A CBT?

iarnav asked in DS Jan 7, 2018

by iarnav

540 views

2 votes

1 answer

155

binary treee
The minimum size that an array may require to store a binary tree with 'n' nodes is ______. if queston is about min size of an array ..then we go with compete binary tree or not.

Jaspreet Kaur Bains asked in Programming in C Jan 3, 2018

by Jaspreet Kaur Bains

564 views

1 vote

0 answers

156

If the average depth of a node in an n-node binary search tree is O(lg n), then the height of the tree is

Rohit Gupta 8 asked in DS Dec 25, 2017

by Rohit Gupta 8

1.1k views

8 votes

1 answer

157

Number of Binary tree
Q.Consider a four labeled 1, 2, 3, 4. The number of distinct binary tree are possible such that whose inorder traversal is 1, 2, 3, 4 are _________ Answer must be 14 right ?

junaid ahmad asked in Programming in C Dec 19, 2017

by junaid ahmad

930 views

3 votes

2 answers

158

ISRO-DEC2017-57
The $in$-$order$ and $pre$-$order$ traversal of a binary tree are $\text{d b e a f c g}$ and $\text{a b d e c f g}$ respectively.The $post$-$order$ traversal of a binary tree is $\text{e d b g f c a}$ $\text{e d b f g c a }$ $\text{d e b f g c a}$ $\text{d e f g b c a}$

gatecse asked in DS Dec 17, 2017

1.2k views

4 votes

2 answers

159

TIFR CSE 2018 | Part B | Question: 6
Consider the following implementation of a binary tree data strucrure. The operator $+$ denotes list-concatenation. That is, $[a,b,c]+[d,e]=[a,b,c,d,e].$ struct TreeNode: int value TreeNode leftChild TreeNode rightChild function preOrder(T): if T == null: ... $\text{Cannot be uniquely determined from given information.}$

Arjun asked in DS Dec 10, 2017

by Arjun

1.4k views

1 vote

0 answers

160

Balanced Binary Tree vs Complete Tree
Balanced Binary Tree vs Complete Tree Insertion and Deletion is faster in which of the above 2 structures?

VS asked in Algorithms Dec 8, 2017

by VS

533 views

2 votes

1 answer

161

How to draw a Binary tree

LoveCS asked in DS Dec 5, 2017

by LoveCS

989 views

0 votes

1 answer

162

height of a tree
For the height of the tree for gate what should we consider the number of edges from the root the leaf or number of levels.????

saipriyab asked in DS Nov 27, 2017

443 views

4 votes

4 answers

163

Number of binary search trees
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264

Parshu gate asked in DS Nov 27, 2017

6.7k views

1 vote

1 answer

164

Tree Traversal doubt
Please tell me - 1) What is top down evaluation of Parse tree? 2) What is Bottom Up evaluation of Parse Tree 3) What is Depth First left to right evaluation of Parse tree? Is 1 and 3 are equal? Please make a small tree and show how to traverse Top down and Bottom up? Also, Explain how Top down and Bottom up Parser work is it same as Tree evaluation?

iarnav asked in Compiler Design Nov 22, 2017

by iarnav

545 views

2 votes

3 answers

165

tree traversals , how to approach?
Let T be a rooted binary tree whose vertices are labelled with symbols a, b, c, d, e, f, g, h, i, j, k. Suppose the in-order and post-order traversals of T produce the following sequences. in-order: a, b, c, d, e, f, g, h, i, j, k post-order: a, c, b, e, f, h, j, k, i, g, d How many leaves does the tree have?

Parshu gate asked in DS Nov 13, 2017

4.5k views

2 votes

3 answers

166

Tree traversals
For a binary tree T, preorder traversal yields: 11,8,6,4,7,10,19,43,31,29,37,49 and inorder traversal yields: 4,6,7,8,10,11,19,29,31,37,43,49 The height of the T is ________________.

Parshu gate asked in DS Nov 13, 2017

2.9k views

7 votes

2 answers

167

Does unique binary tree is possible with full binary tree and preorder and postorder ?
A Full Binary Tree is a binary tree where every node has either 0 or 2 children. what i know with Preorder and Inorder , Inorder and Postorder and Inorder and Level-order ,we can have unique ... can not have unique tree with following Postorder and Preorder. Preorder and Level-order. Postorder and Level-order.

sunil sarode asked in Programming in C Nov 10, 2017

by sunil sarode

3.0k views

0 votes

1 answer

168

Binary Tree construction
Given the preorder/postorder and inorder traversal of a binary tree, we can always construct a unique binary tree (I think so, correct me if I am wrong) Construct a binary tree with the nodes A, B, C such that its preorder traversal is ABC and its inorder traversal is CAB.

humblefool asked in DS Nov 7, 2017

1.2k views

0 votes

0 answers

169

MadeEasy Subject Test: Programming & DS - Binary Tree
Consider program int foo(struct node *tree) { if(tree==0) return 0; int lh=ht(tree->left); int rh=ht(tree->right); int ld=foo(tree->left); int rd=foo(tree->right); return max(lh+rh+1,max(ld,rd)); } ... ) of tree How d could be correct ......it would be correct only when we consider nodes between leaf nodes including leaf nodes itself

sunaina rawat asked in DS Nov 7, 2017

by sunaina rawat

522 views

2 votes

3 answers

170

#madeeasytestseries
The minimum size that an array may require to store a binary tree with 'n' nodes is ______. A. $2^{\left \lceil \log (n+1)) \right \rceil}-1$ B. $2^{n}-1$ C. $2^{n}-n-1$ D. n+1

Mahendra Singh Kanya asked in DS Nov 7, 2017

by Mahendra Singh Kanya

803 views

1 vote

2 answers

171

UGC NET CSE | November 2017 | Part 3 | Question: 31
Consider a full binary tree with $n$ internal nodes, internal path length $I$, and external path length $e$. the internal length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path ... of the following is correct for the full binary tree? $e=i+n$ $e=i+2n$ $e=2i+n$ $e=2n+i$

Arjun asked in Graph Theory Nov 5, 2017

by Arjun

2.2k views

1 vote

1 answer

172

BINARY TREE
A rooted tree with 8 nodes has its nodes [1.....8] in preorder.When the tree is traversed in postorder.....nodes visited are {3,5,4,2,7,8,6,1}. Draw a tree for it. How to solve .....someone please explain?

Shivi rao asked in DS Nov 1, 2017

657 views

3 votes

1 answer

173

Trees
Number of rooted labeled trees(i.e. each node can be the root) with 6 vertices is:

Shivam Chauhan asked in Programming in C Nov 1, 2017

by Shivam Chauhan

1.1k views

2 votes

0 answers

174

Binary Tree
Consider the following routine on binary tree void do(struct btnode *t) { if(t) { Do(t->Rightchild); Do(t->Leftchild); swap(t->Rightchild,t->Leftchild); } } 1) What does Do(t) do on following binary tree after running the code? a) b)

srestha asked in DS Oct 28, 2017

850 views

3 votes

0 answers

175

Binary tree
In a binary tree, the time complexity of best upper and lower bound time required to get number of subtrees having exactly 8 nodes?

srestha asked in DS Oct 14, 2017

461 views

0 votes

2 answers

176

UGC NET CSE | June 2009 | Part 2 | Question: 27
In a full binary tree of height k, there are ______ internal nodes . 2k-1 2k-1 2k 2k+1

rishu_darkshadow asked in DS Sep 22, 2017

by rishu_darkshadow

3.7k views

1 vote

0 answers

177

GATE 1987#Binary Tree
https://gateoverflow.in/2604/gate1995_1-17 .What is the degree of a node in a tree? Is it same as a graph OR the number of children of that node?

Abhi Girin asked in Programming in C Sep 21, 2017

375 views

0 votes

2 answers

178

UGC NET CSE | December 2009 | Part 2 | Question: 21
If the number of leaves in a strictly binary tree is an odd number, then what can you say with full conviction about total number of nodes in the tree ? (A) It is an odd number. (B) It is an even number. (C) It cannot be equal to the number of leaves. (D) It is always greater than twice the number of leaves.

rishu_darkshadow asked in DS Sep 17, 2017

by rishu_darkshadow

2.6k views

3 votes

2 answers

179

Binary Tree
How many numbers of binary tree can be created with 4 nodes which when traversed in post order gives the sequence D, C, B, A? 1. 14 2. 15 3. 10 4. 16 Please Explain. Is there any formula?

nishant279 asked in DS Sep 16, 2017

3.6k views

3 votes

2 answers

180

Trees
Can somebody please list out the main advantages of B trees, B+ trees and Binary Search Trees over each other?

Warlock lord asked in Databases Aug 28, 2017

by Warlock lord

659 views

Page:

« prev
1
2
3
4
5
6
7
8
9
10
11
next »

Recent questions tagged binary-tree