Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C++

Symmetric Tree

Explore how to determine if a binary tree is symmetric around its root by applying breadth-first search techniques. Understand the problem constraints, develop a strategy to check tree symmetry, and practice solving this common interview question using efficient traversal methods.

We'll cover the following...

Statement

Given the root of a binary tree, check whether it is a symmetric tree. A symmetric tree refers to a tree that is a mirror of itself, i.e., symmetric around its root.

Constraints:

  • The tree contains nodes in the range [1,500][1, 500].
  • −103≤-10^3 \le Node.data ≤103\le 10^3

Examples

Understand the problem

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

Symmetric Tree

1.

What will be the output if the following tree is given as input?

tree = [25, 4, 67, 2, 3, 3, 2]

          __ 25 __ 
         |        |
       _ 4 _    _ 67 _ 
      |     |  |      |
      2     3  3      2
A.

TRUE

B.

FALSE

1 / 3

Figure it out!

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Sequence - Vertical
Drag and drop the cards to rearrange them in the correct sequence.
1
2
3
4
5
6
7

Try it yourself

Implement your solution in the following coding playground.

C++
usercode > main.cpp
// Definition for a binary tree node

// template<class T>

// class TreeNode {

// public:

//     T data;

//     TreeNode<T>* left;

//     TreeNode<T>* right;



//     TreeNode(const T data) : data(data), left(nullptr), right(nullptr) {}

// };



// Function to check if a binary tree is symmetric (mirror image of itself)

bool IsSymmetric(TreeNode<int> *root)

{

    // Replace this placeholder return statement with your code

    return false;

}
Symmetric Tree