Binary Trees: Properties and Traversals Previous Year Questions (PYQs) for GATE DA: 3+ Solved Questions with Step-by-Step Solutions

    Solve 3+ Binary Trees: Properties and Traversals previous year questions for GATE DA with answers and detailed solutions. Free sample questions below.

    Chapter Roadmap: Binary Trees

    Chapter Roadmap: Binary Trees

    Master the structural and navigational foundations of the most important tree data structure.

    Your Learning Journey

    1. Binary Tree Traversals and Reconstruction High Importance
    • Master pre-order, in-order, and post-order traversals.
    • Learn to uniquely reconstruct a tree from traversal sequences.
    • Understand the Full Binary Tree exception for pre-order and post-order.
    2. Binary Tree Structural Properties Moderate Importance
    • Explore mathematical relationships between height, internal nodes, and leaves.
    • Derive bounds on the number of nodes for a given height.
    • Solve equations relating different tree parameters.

    Binary Tree Traversals and Reconstruction

    Binary Tree Traversals and Reconstruction

    Master the art of rebuilding a tree from its shadows.

    Chapter Context: Binary Trees: Properties and Traversals

    What you will learn here

    1. The core depth-first traversals (Pre-order, In-order, Post-order).
    2. The mandatory role of In-order traversal in resolving left-right ambiguity.
    3. Step-by-step methods to reconstruct a tree.
    4. The Full Binary Tree exception for Pre-order and Post-order.

    Binary Trees: Properties and Traversals: Solved Questions with Step-by-Step Explanations (3 Problems)

    Question 1 · Programming, Data Structures and Algorithms MSQ
    You are given the following Pre-order and In-order traversals of a Binary Tree T with nodes E, F, G, P, Q, R, S.
    Pre-order: P Q S E R F G
    In-order: S Q E P F R G
    Which of the following statements is/are true about the Binary Tree T?
    1. A.

      Node P is the root of T

    2. B. The Post-order traversal of T is:
      S E Q F G R P
    3. C.

      Node Q has only one child

    4. D.

      The left subtree of node R contains the node G

    Question 2 · Programming, Data Structures and Algorithms MSQ
    Consider the following tree traversals on a full binary tree:
    Preorder
    Inorder
    Postorder
    Which of the following traversal options is/are sufficient to uniquely reconstruct
    the full binary tree?
    1. A.

      and

    2. B.

      and

    3. C.

      and

    4. D.

      only

    Question 3 · Programming, Data Structures and Algorithms MSQ
    Let and represent height, number of internal nodes, number of leaf nodes,
    and the total number of nodes respectively in a rooted binary tree.
    Which of the following statements is/are always TRUE?
    1. A.

    2. B.

    3. C.

    4. D.

    More previous year questions (pyqs) in this unit

    chapter
    Binary Trees: Properties and Traversals Previous Year Questions (PYQs) for GATE DA: 3+ Solved Questions with Step-by-Step Solutions

    Solve 3+ Binary Trees: Properties and Traversals previous year questions for GATE DA with answers and detailed solutions. Free sample questions below.

    A question from this chapter

    Question 1
    You are given the following Pre-order and In-order traversals of a Binary Tree T with nodes E, F, G, P, Q, R, S.
    Pre-order: P Q S E R F G
    In-order: S Q E P F R G
    Which of the following statements is/are true about the Binary Tree T?
    Question 2
    Consider the following tree traversals on a full binary tree:
    Preorder
    Inorder
    Postorder
    Which of the following traversal options is/are sufficient to uniquely reconstruct
    the full binary tree?
    Question 3
    Let and represent height, number of internal nodes, number of leaf nodes,
    and the total number of nodes respectively in a rooted binary tree.
    Which of the following statements is/are always TRUE?
    Free preview ends here

    Login to view the complete previous-year questions and solutions

    Creating an account is free. You get the rest of this chapter, step-by-step solutions, and a study plan built around the topics you are actually weak at.

    Login to continueSee plans
    Why MastersUp

    Personalised first. High quality throughout.

    Most platforms hand everyone the same content. Here the content moves with your performance, topic by topic.

    Built around you, not around a syllabus PDF

    Every answer you give moves your topic-level intelligence rate. The next question, the next revision card and tomorrow's plan all change with it.

    Revision that hits your weak spots

    We only revise topics you have actually attempted and are still below the safe bar on — never the same chapter on repeat.

    Questions calibrated to the real exam

    Each question carries a measured toughness. You are served a rung above your current level, so practice keeps stretching you.

    Notes written for recall, not for volume

    Full lesson cards for first study, curated short-note cards for the last mile — with derivations, traps and exam patterns marked.

    One place for everything

    Notes, chapter practice, previous-year questions, test series and full-length papers — all feeding one picture of your preparation.

    Honest progress

    No vanity streaks. Progress here means chapters mastered and accuracy that held up on harder questions.

    Unlock the whole course

    Full notes and short notes, the complete question bank with worked solutions, mock tests, full-length papers, and an adaptive plan that rebuilds itself as you improve.

    View all plansStart free