LeetCode Same Tree
来源:互联网 发布:杭州g20知乎 编辑:程序博客网 时间:2024/04/26 10:16
Same Tree
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.
/** * 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) { // Start typing your C/C++ solution below // DO NOT write int main() function 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 - Tree - Same Tree
- [leetcode][tree] Same Tree
- LeetCode: Same Tree
- LeetCode Same Tree
- [Leetcode] Same Tree
- LeetCode : Same Tree
- [LeetCode] Same Tree
- leetcode 65: Same Tree
- Leetcode 100 Same Tree
- [leetcode] Same Tree
- [LeetCode]Same Tree
- [leetcode]Same Tree
- [Leetcode]Same Tree
- Leetcode: Same Tree
- [LeetCode] Same Tree
- LeetCode-Same Tree
- [leetcode] Same Tree
- LeetCode - Same Tree
- Here I am,it‘s a new start
- 扫雷程序完美版!!!!!!可以通过点击鼠标来翻开格子或者做上标记 !!!!!!!
- CSS样式应用小实例(改变下拉列表选项颜色)
- 程序员面试题精选100题(19)-反转链表
- Linux经典书籍推荐
- LeetCode Same Tree
- linux解压 tar命令
- Mac OS X 10.6下安装MySQL 5.1.45
- boost 正则表达式
- 人脉是设计出来的(实战篇) 读书笔记
- 多线程编程注意事项 .
- linux内核笔记之一
- 虔诚的心
- Tyvj P2068(寻宝)