[DFS] leetcode 100. Same Tree
来源:互联网 发布:英文缩写查询软件 编辑:程序博客网 时间:2024/06/05 00:21
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; * 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)||(p&&!q)) return false; if(p==NULL&&q==NULL) return true; if(p->val!=q->val) return false; return p->val==q->val&&isSameTree(p->left,q->left)&&isSameTree(p->right,q->right); }};
阅读全文
0 0
- 【Leetcode】100. Same Tree 【DFS】
- [DFS] leetcode 100. Same Tree
- LeetCode oj 100. Same Tree (DFS||BFS)
- DFS:100. Same Tree
- leetcode 100. Same Tree 二叉树DFS深度优先遍历
- [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
- [LeetCode]100. Same Tree
- 100. Same Tree LeetCode
- LeetCode 100. Same Tree
- LeetCode 100. Same Tree
- java单元测试——JUnit4Hamcrest
- 初试cocos
- ajax百度搜索框
- volatile的作用
- oracle '',null
- [DFS] leetcode 100. Same Tree
- Context都没弄明白,还怎么做Android开发?
- Android之FlexboxLayout弹性布局的介绍
- java系统高并发解决方案
- Codeforces Round #420 (Div. 2) 821C
- 快速幂取模算法
- 小米手机android studio常见错误
- Jquery瀑布流布局
- mysql count多个表