Symmetric Tree-LeetCode
2014-10-22 16:25
288 查看
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 following is not:
For example, this binary tree is symmetric:
1 / \ 2 2 / \ / \ 3 4 4 3
But the following is not:
1 / \ 2 2 \ \ 3 3
struct TreeNode { int val; TreeNode *left; TreeNode *right; TreeNode(int x) : val(x), left(NULL), right(NULL) {} }; bool issame(TreeNode *root1, TreeNode *root2) { if (root1 == NULL && root2 == NULL) { return true; } if (root1 == NULL || root2 == NULL || root1->val != root2->val) { return false; } return issame(root1->left, root2->right)&&issame(root1->right, root2->left); } bool isSymmetric(TreeNode *root) { if (root == NULL) return true; return issame(root->left, root->right); }
相关文章推荐
- LeetCode(25)-symmetric tree
- [leetcode] Symmetric Tree
- leetcode-101-Symmetric Tree
- LeetCode:Symmetric Tree(镜像二叉树)
- [leetcode]Symmetric Tree
- [leetcode刷题系列]Symmetric Tree
- LeetCode 101. Symmetric Tree
- LEETCODE--Symmetric Tree
- [Leetcode] Symmetric Tree (Java)
- [LeetCode] Symmetric Tree(对称镜像树的判别)
- LeetCode--Symmetric Tree
- leetCode---Symmetric Tree
- LeetCode - Symmetric Tree
- LeetCode:Symmetric Tree
- leetcode101 Symmetric Tree
- LeetCode-Symmetric Tree
- LeetCode 101 Symmetric Tree
- LeetCode: Symmetric Tree
- LeetCode 154题:Symmetric Tree
- LeetCode -- Symmetric Tree