Skip to content

Latest commit

 

History

History
21 lines (13 loc) · 294 Bytes

File metadata and controls

21 lines (13 loc) · 294 Bytes

Problem 101: Symmetric Tree

Difficulty: Easy

Problem

Given a binary tree, check whether it is a mirror of itself (ie, symmetric around its center).

Example

For example, this binary tree [1,2,2,3,4,4,3] is symmetric:

    1
   / \
  2   2
 / \ / \
3  4 4  3