All Exams Test series for 1 year @ ₹349 only
Question

Binary tree with root A and nodes B to H

Considering above binary tree, what will be the inorder traversal

This question was previously asked in
UGC NET 2024 Management Question Paper (02-Sep-2024) (Shift 2)
The correct answer is

B A D C E G F H

Inorder traversal visits the left subtree, then the node, then the right subtree, recursively.

Step 1 — Read the tree: A has left child B and right child C; C has left child D and right child E; E has only a right child F; F has left child G and right child H.

Step 2 — Inorder(A) = Inorder(B), A, Inorder(C) = B, A, Inorder(C).

Step 3 — Inorder(C) = D, C, Inorder(E); Inorder(E) = E, Inorder(F) since E has no left child; Inorder(F) = G, F, H.

Step 4 — Combining: B A D C E G F H.

G H F E D C B A and G H F D E B C A start with G, which is how a postorder-like or reversed listing begins, not an inorder one. B A C D E G F H places C before its left child D, which breaks the left-node-right rule.

B A D C E G F H option is correct.

Was this answer helpful?

Similar Questions

  1. The inorder traversal of the following tree is :

  2. Level order Traversal of a rooted Tree can be done by starting from root and performing :

  3. The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is __________.

  4. Arrange the following steps of the Inorder Traversal of Binary Tree in the correct order.

    A. Visit the Left subtree

    B. Visit the Root node

    C. Visit the Right subtree

    D. Start traversing by visiting the nodes in rooted tree

    E. Repeat the above three steps.

    Choose the correct answer from the options given below:


Important Questions from Tree Traversal - Teaching

  1. Consider the traversal of a tree

    Preorder → ABCEIFJDGHKL

    Inorder → EICFJBGDKHLA

    Which of the following is correct post order traversal?

  2. Postorder traversal of a given binary search tree T produces following sequence of keys: 3, 5, 7, 9, 4, 17, 16, 20, 18, 15, 14 Which one of the following sequences of keys can be the result of an in-order traversal of the tree T?

  3. The inorder traversal of the following tree is :

  4. Level order Traversal of a rooted Tree can be done by starting from root and performing :

  5. The inorder and preorder Traversal of binary Tree are dbeafcg and abdecfg respectively. The post-order Traversal is __________.

Need Expert Advice?
Upcoming Exams
CTET
December 12, 2026
Test Series
UGC NET img
Teaching
UGC NET (Paper 2) 2026 Mock Test Series
796 Tests 2 Tests Free
4.4(39)
English
More Questions from UGC NET

Start Your Preparation with Prepp Mobile App

Download the app from Google Play & App Store
Download the app from Google Play & App Store
Prepp Mobile App