[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 is symmetric: But the fol
posted @ 2014-10-26 10:49  Grandyang  阅读(17255)  评论(17)  编辑  收藏  举报
Fork me on GitHub