LeetCode--Symmetric Tree
2015-01-14 10:13
330 查看
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:
Note:
Bonus points if you could solve it both recursively and iteratively.
confused what
read more on how binary tree is serialized on OJ.
For example, this binary tree is symmetric:
1 / \ 2 2 / \ / \ 3 4 4 3
But the following is not:
1 / \ 2 2 \ \ 3 3
Note:
Bonus points if you could solve it both recursively and iteratively.
confused what
"{1,#,2,3}"means? >
read more on how binary tree is serialized on OJ.
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: bool isSymmetric(TreeNode *root) { if(root == NULL) return true; return isSymmetric(root->left,root->right); } bool isSymmetric(TreeNode* left,TreeNode* right) { if(left==NULL && right==NULL) return true; if(left==NULL || right==NULL) return false; bool l = isSymmetric(left->right,right->left); if(left->val != right->val) return false; bool r = isSymmetric(left->left,right->right); return l&&r; } };
相关文章推荐
- LeetCode | Symmetric Tree(镜像树)
- LeetCode101 Symmetric Tree
- 【Leetcode】Symmetric Tree (Tree Judge)
- Symmetric Tree——LeetCode
- 【leetcode c++】101 Symmetric Tree
- leetcode - symmetric tree
- leetcode 之 Symmetric Tree
- leetcode(24).101. Symmetric Tree
- Symmetric Tree —— Leetcode
- LeetCode:Symmetric Tree
- LeetCode[Tree]: Symmetric Tree
- leetcode: Symmetric Tree
- 【LeetCode】101 - Symmetric Tree
- [leetcode] Symmetric Tree
- LeetCode 101. Symmetric Tree(Python)
- Leetcode: Symmetric Tree
- leetcode - Symmetric Tree
- LeetCode Symmetric Tree
- leetcode- Symmetric Tree
- [leetcode]_Symmetric Tree