Recent questions tagged binary-tree

3 votes
0 answers
151
Consider a binary tree T that has 150 leaf nodes. Then the number of TOTAL nodes in T that have exactly two children are ______.
–2 votes
0 answers
152
Consider a binary tree T that has 100 leaf nodes. Then the number of nodes in T that have exactly ONE children are ______.
1 votes
1 answer
153
Consider a binary tree T that has 100 leaf nodes. Then the number of INTERNAL nodes in T that have exactly two children are ______.
–1 votes
1 answer
154
IS IT A CBT?
2 votes
1 answer
155
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 ...
1 votes
0 answers
156
If the average depth of a node in an $n$-node binary search tree is $O(\log{n})$, then the height of the tree is$O(n\log{n})$$O(n)$$O(\log{n})$$O(\sqrt(n\log{n}))$
8 votes
1 answer
157
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...
3 votes
2 answers
158
1 votes
0 answers
160
Balanced Binary Tree vs Complete TreeInsertion and Deletion is faster in which of the above 2 structures?
2 votes
1 answer
161
0 votes
1 answer
162
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.????
4 votes
4 answers
163
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264
2 votes
3 answers
166
For a binary tree T,preorder traversal yields: 11,8,6,4,7,10,19,43,31,29,37,49 andinorder traversal yields: 4,6,7,8,10,11,19,29,31,37,43,49The height of the T is _____...
2 votes
3 answers
170
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 votes
1 answer
172
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 s...
3 votes
1 answer
173
Number of rooted labeled trees(i.e. each node can be the root) with 6 vertices is:
2 votes
0 answers
174
Consider the following routine on binary treevoid do(struct btnode *t) { if(t) { Do(t->Rightchild); Do(t->Leftchild); swap(t->Rightchild,t->Leftchild); } }1) What does Do...
3 votes
0 answers
175
In a binary tree, the time complexity of best upper and lower bound time required to get number of subtrees having exactly 8 nodes?
0 votes
2 answers
176
1 votes
0 answers
177
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?
3 votes
2 answers
179
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. 142. 153. 104. 16Please Explain.Is there a...
3 votes
2 answers
180
Can somebody please list out the main advantages of B trees, B+ trees and Binary Search Trees over each other?