Binary-search-tree
October 8, 2023Data-Structures
October 8, 2023Data-Structures
| Question 46 |
Draw all binary trees having exactly three nodes labeled A, B and C on which Preorder traversal gives the sequence C, B, A.
| Theory Explanation is given below. |
Question 46 Explanation:
Total 5 binary trees are possible with the preorder C, B, A.
Correct Answer: A
Question 46 Explanation:
Total 5 binary trees are possible with the preorder C, B, A.
Subscribe
Login
0 Comments