leetcode--100. Same Tree
来源:互联网 发布:ubuntu vi命令 编辑:程序博客网 时间:2024/05/29 14:18
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) return p == q; return p->val == q->val && isSameTree(p->left, q->left) && isSameTree(p->right, q->right); }};
0 0
- [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
- [LeetCode]100. Same Tree
- 【LeetCode】100. Same Tree
- leetcode 100. Same Tree
- leetcode 100. Same Tree
- 【Leetcode】100. Same Tree
- modeldriven,prepare拦截器和paramsPrepareParamsStack栈
- C语言------练习题
- Android必学之AsyncTask
- NYOJ31 - 5个数求最值
- java生成和操作Excel文件
- leetcode--100. Same Tree
- 1039. 到底买不买(20)
- POJ1267 Cash machine 多重背包
- codevs4373&洛谷1866 滑动窗口
- 实现shell四则运算
- 嵌入式Linux-内存管理基础
- NYOJ77 - 开灯问题
- android面试笔试题详解
- 1021. Deepest Root (25)