Considering the binary tree shown (A has children B and C; C has children D and E; E has right child F; F has children G and H), what will be the inorder traversal?
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. BADCEGFH
Explanation
Inorder = left, root, right: B, A, then C's subtree: D, C, E's subtree (E, then F's subtree G, F, H). Result: B A D C E G F H.
More Data Structures and Algorithms questions
- Match the LIST-I with LIST-II
- Which of the following algorithms are based on the Breadth First Search (BFS) ? A. Prim's algorithms B. Kruskal algorithms C. Dijkstra algo…
- Which of the following is the solution of the recurrence T(n) = T(2n/3) + 1?
- Match the LIST-I with LIST-II
- Arrange the following recurrence relations in increasing order of their time complexity: (A) T(n) = T(n/2) + 1 (B) T(n) = 2T(n/2) + n (C) T…
- Select the Sorting Algorithms that are stable. (A) Quick Sort (B) Bubble Sort (C) Insertion Sort (D) Merge Sort (E) Shell Sort