LeetCode - Same Tree
来源:互联网 发布:淘宝店和微商的区别 编辑:程序博客网 时间:2024/03/29 18:05
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) { if(p==NULL&&q==NULL){return true;}if(p&&q&&p->val==q->val){return isSameTree(p->left,q->left)&&isSameTree(p->right,q->right);} return false; }};
- 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
- FindWindow寻找窗口列表中第一个符合指定条件的顶级窗口
- 在进入Mapper之前的输入分片处理过程详解
- GetClassName
- poj 3311 Hie with the Pie(状态压缩DP+最短路)
- Boyer-Moore算法学习
- LeetCode - Same Tree
- 两个List<Model>集合合并 并且去重方式
- 单链表与代码
- Class文件格式解析
- ZYNQ学习笔记(一) HelloWorld实现
- 对新手有用的JavaScript开发小建议
- HDU--2829--Lawrence--斜率优化做法
- 括号匹配(二)
- linux内存屏障浅析