LeetCode:Same Tree
来源:互联网 发布:微信加好友软件靠谱吗 编辑:程序博客网 时间:2024/06/08 07:03
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 a binary tree node. * struct TreeNode { * int val; * struct TreeNode *left; * struct TreeNode *right; * }; */bool isSameTree(struct TreeNode* p, struct TreeNode* q) { if (p != NULL && q != NULL && p->val == q->val){ return isSameTree(p->left, q->left) && isSameTree(p->right, q->right); } else if (p == NULL && q == NULL) return true; else return false; }
1 0
- 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
- tomcat源码解析(三)——Digester类源码解析及Rule分析
- 消息模型及其伪代码
- java基础回顾之-IO流
- hr在浏览器中样式兼容性的设置
- PopUpWindow使用详解(二)——进阶及答疑
- LeetCode:Same Tree
- C++多态
- 代码的正常分支需要打印log吗?
- 使用WM_PASTE 和 WM_CHAR 消息时中文乱码总结
- 人脸识别CSV文件(c++实现)
- 组合模式
- android 用GridView加载Bitmap 内存溢出问题总结
- 每天工作4小时的程序员感悟
- English in July