Register

Recent questions tagged binary-tree

0 votes
2 answers
211
Programming & DS - Binary Tree
Whats wrong with option B? Give an example?
Whats wrong with option B?Give an example?
User Avatar
2 votes
2 answers
212
common ancestors of two nodes in AVl tress
can anyone define the procedure to find the common ancestor of any two given nodes in balanced BST..??
can anyone define the procedure to find the common ancestor of any two given nodes in balanced BST..??
User Avatar
14 votes
3 answers
213
GATE CSE 1988 | Question: 7iii
Consider the tree given in the below figure, insert $13$ and show the new balance factors that would arise if the tree is not rebalanced. Finally, carry out the required rebalancing of the tree and show the new tree with the balance factors on each mode.
Consider the tree given in the below figure, insert $13$ and show the new balance factors that would arise if the tree is not rebalanced. Finally, carry out the required ...
User Avatar
6 votes
2 answers
214
GATE CSE 1988 | Question: 7ii
Mark the balance factor of each node on the tree given in the below figure and state whether it is height-balanced.
Mark the balance factor of each node on the tree given in the below figure and state whether it is height-balanced.
User Avatar
8 votes
2 answers
215
GATE CSE 1988 | Question: 7i
Define the height of a binary tree or subtree and also define a height-balanced (AVL) tree.
Define the height of a binary tree or subtree and also define a height-balanced (AVL) tree.
User Avatar
2 votes
1 answer
218
No of binary tree
number of distinct binary tree,that can be created by 5 nodes(distinct)
number of distinct binary tree,that can be created by 5 nodes(distinct)
User Avatar
5 votes
1 answer
219
trees
User Avatar
1 votes
1 answer
220
number of distinct binary search trees
The answer is given as 14.I calculated using Catalan number but the answer did not come as 14.
The answer is given as 14.I calculated using Catalan number but the answer did not come as 14.
User Avatar
0 votes
3 answers
223
Binary tree Made-easy-test-series
The minimum size that an array may require to store a binary tree with n nodes $2^{\left \lceil(log_2(n+1)) \right \rceil -1}$ $2n-1$ $2n-n+1$ $n+1$
The minimum size that an array may require to store a binary tree with n nodes$2^{\left \lceil(log_2(n+1)) \right \rceil -1}$$2n-1$$2n-n+1$$n+1$
User Avatar
4 votes
1 answer
225
Trees
User Avatar
0 votes
1 answer
226
Question Binary tree
User Avatar
18 votes
3 answers
227
GATE CSE 1987 | Question: 7b
Construct a binary tree whose preorder traversal is $K\;L\;N\;M\;P\;R\;Q\;S\;T$ and inorder traversal is $N\;L\;K\;P\;R\;M\;S\;Q\;T$
Construct a binary tree whose preorder traversal is$K\;L\;N\;M\;P\;R\;Q\;S\;T$and inorder traversal is$N\;L\;K\;P\;R\;M\;S\;Q\;T$
User Avatar
19 votes
3 answers
228
GATE CSE 1987 | Question: 2g
State whether the following statements are TRUE or FALSE: If the number of leaves in a tree is not a power of $2,$ then the tree is not a binary tree.
State whether the following statements are TRUE or FALSE:If the number of leaves in a tree is not a power of $2,$ then the tree is not a binary tree.
User Avatar
31 votes
5 answers
229
GATE CSE 1987 | Question: 2c
State whether the following statements are TRUE or FALSE: It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?
State whether the following statements are TRUE or FALSE:It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given?
User Avatar
0 votes
1 answer
230
Binary Trees
I have seen that in some question height and deapth of binary tree are used interchangably. So, I request to say difference between height and deapth of a binary tree.
I have seen that in some question height and deapth of binary tree are used interchangably. So, I request to say difference between height and deapth of a binary tree.
User Avatar
1 votes
1 answer
231
Which of the following are true ?
User Avatar
0 votes
0 answers
232
Kerala PSC AP Exam
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is A) 15 B) 11 C) 12 D) 10
IN a binary tree, the number of internal nodes of degree one is 5 and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree isA) 15B...
User Avatar
0 votes
0 answers
233
Kerala PSC AP Exam
In a binary tree, for every node the difference between the number of nodes in the left and right sub trees is atmost 2. If the height of the tree is h > 0 , then the minimum number of nodes in the tree is A) 2 h-1 B) 2h-1 +1 C) 2h - 1 D) 2h
In a binary tree, for every node the difference between the number of nodes in the left and right sub trees is atmost 2. If the height of the tree is h 0 , then the min...
User Avatar
2 votes
1 answer
234
binary tree
The height of a binary tree having $`\text{i’}$ nodes at level $`\text{i’}$ considering root to be at level $1$ is __________, where $`n\text{’}$ is the total no. of nodes in the tree. $O(\log n)$ $(O(n)$ $O(\sqrt{n})$ $O(n^{2})$
The height of a binary tree having $ \text{i’}$ nodes at level $ \text{i’}$ considering root to be at level $1$ is __________, where $ n\text{’}$ is the total no. o...
User Avatar
0 votes
1 answer
237
GATE Overflow | Data Structures | Test 1 | Question: 14
Consider the array given below: 20 10 9 8 7 6 5 It is a full binary tree in array representation a complete binary tree in array representation a max-heap in array representation all of the above
Consider the array given below:20 10 9 8 7 6 5It isa full binary tree in array representationa complete binary tree in array representationa max-heap in array representat...
User Avatar
1 votes
2 answers
238
GATE Overflow | Data Structures | Test 1 | Question: 10
With 5 distinct nodes, the maximum no. of binary trees that can be formed is _____
With 5 distinct nodes, the maximum no. of binary trees that can be formed is _____
User Avatar
3 votes
4 answers
240
GATE Overflow | Data Structures | Test 1 | Question: 8
What is the number of binary trees with $4$ nodes which when traversed in pre-order gives the sequence A, B, C, D?
What is the number of binary trees with $4$ nodes which when traversed in pre-order gives the sequence A, B, C, D?
User Avatar
Page: