Data Structures | Tree Traversals | Question 9

Which of the following cannot generate the full binary tree?
(A) Inorder and Preorder
(B) Inorder and Postorder
(C) Preorder and Postorder
(D) None of the above

Answer: (D)
Explanation: To generate a binary tree, two traversals are necessary and one of them must be inorder. But, a full binary tree can be generated from preorder and postorder traversals. Read the algorithm here.
Read Can tree be constructed from given traversals?
Quiz of this Question

Article Tags :

Data Structures

DSA

Data Structures

Data Structures-Tree Traversals

Tree Traversals

Recommended Articles

1. Data Structures | Tree Traversals | Question 1

2. Data Structures | Tree Traversals | Question 2

3. Data Structures | Tree Traversals | Question 3

4. Data Structures | Tree Traversals | Question 4

5. Data Structures | Tree Traversals | Question 5

6. Data Structures | Tree Traversals | Question 6

7. Data Structures | Tree Traversals | Question 7

8. Data Structures | Tree Traversals | Question 8

9. Data Structures | Tree Traversals | Question 10

10. Data Structures | Tree Traversals | Question 11

11. Data Structures | Tree Traversals | Question 12

12. Check if given inorder and preorder traversals are valid for any Binary Tree without building the tree

13. Overview of Graph, Trie, Segment Tree and Suffix Tree Data Structures

14. Construct Full Binary Tree from given preorder and postorder traversals

15. Binary Search Tree (BST) Traversals – Inorder, Preorder, Post Order

16. Construct Tree from given Inorder and Preorder traversals

17. Construct a tree from Inorder and Level order traversals | Set 1

18. Construct a tree from Inorder and Level order traversals | Set 2

19. Check if given Preorder, Inorder and Postorder traversals are of same tree | Set 2

20. Check if given Preorder, Inorder and Postorder traversals are of same tree

21. Merkle Tree and Hash Chain Data Structures with difference

22. Print Postorder traversal from given Inorder and Preorder traversals

23. Preorder from Inorder and Postorder traversals

24. Delete an element from array (Using two traversals and one traversal)

25. Collect maximum points in a grid using two traversals