LeetCode – Refresh – Symmetric Tree
2015-03-24 16:51
218 查看
/**
* 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 isS(TreeNode *t1, TreeNode *t2) {
if (!t1 && !t2) return true;
if (!t1 || !t2) return false;
if (t1->val != t2->val) return false;
return isS(t1->left, t2->right) && isS(t1->right, t2->left);
}
bool isSymmetric(TreeNode *root) {
if (!root) return true;
return isS(root->left, root->right);
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- Leetcode---Symmetric Tree
- 【Leetcode】Symmetric Tree
- [leetcode]Symmetric Tree
- leetcode- Symmetric Tree
- LeetCode 101:Symmetric Tree
- LeetCode – Refresh – Best Time to Buy and Sell Stock ii
- LeetCode – Refresh – Flatten Binary Tree To Linked List
- LeetCode – Refresh – Interleaving String
- LeetCode – Refresh – Longest Substring Without Repeating Characters
- LeetCode – Refresh – Maximum Gap
- LeetCode – Refresh – Populating Next Right Pointers in Each Node I and II
- LeetCode – Refresh – Remove Duplicates from Sorted List II
- LeetCode – Refresh – Sqrt(x)
- [LeetCode]--Symmetric Tree
- LeetCode - 101 - Symmetric Tree
- [leetcode] 101. Symmetric Tree
- leetcode-Symmetric Tree 对称树
- Symmetric Tree —— Leetcode
- [leetcode] Symmetric Tree－－二叉树遍历的应用
- [leetcode] Symmetric Tree