Data Structures | Tree Traversals | Question 12
The array representation of a complete binary tree contains the data in sorted order. Which traversal of the tree will produce the data in sorted form?
(A) Preorder
(B) Inorder
(C) Postorder
(D) Level order
Answer: (D)
Explanation: The level order traversal of a binary tree prints the data in the same order as it is stored in the array representation of a complete binary tree.
Quiz of this Question
Recommended Posts:
- Data Structures | Tree Traversals | Question 4
- Data Structures | Tree Traversals | Question 11
- Data Structures | Tree Traversals | Question 9
- Data Structures | Tree Traversals | Question 8
- Data Structures | Tree Traversals | Question 2
- Data Structures | Tree Traversals | Question 1
- Data Structures | Tree Traversals | Question 7
- Data Structures | Tree Traversals | Question 6
- Data Structures | Tree Traversals | Question 3
- Data Structures | Tree Traversals | Question 10
- Data Structures | Tree Traversals | Question 5
- Introduction to Data Structures | 10 most commonly used Data Structures
- Data Structures | Queue | Question 10
- Data Structures | Heap | Question 12
- Data Structures | Stack | Question 8
- Must Do Coding Questions for Companies like Amazon, Microsoft, Adobe, ...
- How to find the parent class name with known class in jQuery ?
- D3.js | d3.entries() Function
- Find the winner of the Game to Win by erasing any two consecutive similar alphabets
- Find the integers that doesnot ends with T1 or T2 when squared and added X