[leetcode 100] Same Tree
2014-12-31 21:23
281 查看
Given two binary trees, write a function to check if they are equal or not.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
Two binary trees are considered equal if they are structurally identical and the nodes have the same value.
/** * 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 isSameTree(TreeNode *p, TreeNode *q) { if (!p && !q) { return true; } if (!p || !q) { return false; } return p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right); } };
相关文章推荐
- leetcode_100_Same Tree (C++)(easy)
- Leetcode 100 Same Tree 二叉树
- Leetcode #100 Same tree
- [LeetCode100]Same Tree
- leetcode 100 Same Tree(难易度:Easy)
- LeetCode 100 Same Tree
- LeetCode题解-100-Same Tree
- LeetCode之100. Same Tree
- LeetCode-100-Same Tree-E
- leetcode 100 same tree
- leetcode-100 Same Tree
- Java for LeetCode 100 Same Tree
- [leetcode]#100. Same Tree
- leetcode 100 Same Tree
- LeetCode 100: Same Tree
- [leetcode] 100 Same Tree
- leetcode || 100、Same Tree
- LeetCode 100: Same Tree
- [LeetCode#100]Same Tree
- LeetCode 100 Same Tree