Leetcode-same-tree
来源:互联网 发布:安卓手机怎么查mac 编辑:程序博客网 时间:2024/06/03 15:50
题目描述
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.
比较两棵树是不是相同的树,既要比较结构,也要比较节点的值。
如果根节点都为空,则返回true,如果有一个为空,另一个不为空,返回false,如果根节点都不会空,但是节点值不同,返回false,除此以外的情况,返回左节点的比较情况和右节点的比较情况的与值。
* public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public boolean isSameTree(TreeNode p, TreeNode q) { if(p == null && q == null) return true; if(p == null || q == null) return false; if(p.val != q.val) return false; return isSameTree(p.left,q.left)&&isSameTree(p.right,q.right); }}
0 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
- perl uri_escape(urlencode ) 转换
- unity启动后一直停留在connecting界面
- [最大密度子图 最小割] ACM 2014 Xian C The Problem Needs 3D Arrays
- LeetCode - 198. House Robber
- 《UNIX环境高级编程》---3.文件I/O
- Leetcode-same-tree
- C#控制台 结构中的静态成员
- BZOJ 1012 最大数maxnumber(树状数组)
- 利用求余判断素数
- 基于 flask 框架的模拟instagram 图片分享网站的开发 3
- PHPOO知识点总结
- TCP/IP编程之socket函数详解
- UESTC 838 母仪天下(树状数组)
- Java学习-标识符-变量-基本类型