Register

Please solve this Q

• retagged by
461 views
0 votes
0 votes

• retagged by
User Avatar

1 Answer

0 votes
0 votes
both are not true. for statement I concerning BST inorder with preorder/post order is required. for statement II, each node has at most TWO children mean node may have one child also. In such a CASE NO OF LEAVE NODES MAY NOT EXPRESSED IN POWER OF 2.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

2 votes
2 votes
2 answers
2
GO Classes asked Feb 4
334 views
Memory Based GATE DA 2024 | Question: 23
Consider a binary tree. Among the following traversal combinations, which of them can uniquely construct the tree? Inorder + Preorder Preorder + Postorder Only Inorder Inorder + Postorder
Consider a binary tree. Among the following traversal combinations, which of them can uniquely construct the tree?Inorder + PreorderPreorder + PostorderOnly InorderInorde...
User Avatar
2 votes
2 votes
1 answer
3
GO Classes asked Jan 21
444 views
GO Classes Test Series 2024 | Mock GATE | Test 12 | Question: 31
How many binary trees with $3$ nodes, $\text{A, B},$ and $\text{C}$ when traversed in post-order will give the sequence $\text{A, B, C}?$ (It is NOT a search tree)
How many binary trees with $3$ nodes, $\text{A, B},$ and $\text{C}$ when traversed in post-order will give the sequence $\text{A, B, C}?$ (It is NOT a search tree)
User Avatar
Link Copied!