[leetcode] 100. Same Tree
来源:互联网 发布:免费聊天软件 编辑:程序博客网 时间:2024/06/05 08:47
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.
我的代码
二叉树每个结点最多有两个子结点。
对二叉树的各种操作要熟悉, 轻松搞定面试中的二叉树题目一文讲得很好。
深搜,简单的递归:
(1)如果两棵树同时为空,返回真;
(2)如果两棵树,一棵为空一棵不为空返回假;
(3)都不为空时,比较左右子树,左右子树都相同则返回真。
/** * 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 true; } else if (!p || !q) { return false; } if(p->val == q->val) { if(isSameTree(p->left, q->left)&&isSameTree(p->right, q->right)) return true; } return false; }};
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
- idea启动tomcat远程debug
- Qt修炼手册9_Ui名字空间及setupUi()原理解读
- 信息处理排序--PAT.1080.Graduate Admission【余3】
- Android开发-单选框/多选框
- mysql学习之基础知识
- [leetcode] 100. Same Tree
- Android常见内存泄露,学会这六招大大优化APP性能
- redis 集群(3.0版本开始支持集群功能)
- springboot-springSecurity 之 http Basic认证 (四)
- 78. Subsets
- EAS BOS F7控件过滤(含表头和表体)
- PAT 1004. 成绩排名 (20)
- Rxjava讲解
- 前端大牛博客链接