Skip to content

Latest commit

 

History

History
100 lines (67 loc) · 1.71 KB

0101-symmetric-tree.adoc

File metadata and controls

100 lines (67 loc) · 1.71 KB
Raw

101. Symmetric Tree

{leetcode}/problems/symmetric-tree/[LeetCode - Symmetric Tree^]

为什么执行结果显示递归更快？而不是队列呢？

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

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

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

But the following [1,2,2,null,3,null,3] is not:

    1
   / \
  2   2
   \   \
   3    3

Note:

Bonus points if you could solve it both recursively and iteratively.

思路分析

{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
{image_attr}
一刷
link:{sourcedir}/_0101_SymmetricTree.java[role=include]
二刷
link:{sourcedir}/_0101_SymmetricTree_2.java[role=include]
三刷
link:{sourcedir}/_0101_SymmetricTree_3.java[role=include]