【Leetcode】Same Tree (Tree Judge)
来源:互联网 发布:网络url地址是什么 编辑:程序博客网 时间:2024/05/02 12:00
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.
两个树完全相等要求节点完全相同且里面的值完全相同
因为只要p和q的某一个相同节点的值不相同就为假,而需要遍历完所有的点和值且都相等才为真,所以应该判断值的不同。
压栈思路:先左节点全入,然后左出右入。在压栈的过程中先后比较左右节点是否为空,并且比较值是否相等。
特殊情况:都为空树,则相等,只有一个为空树,则一定不相等。
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; boolean left = isSameTree(p.left, q.left); boolean right = isSameTree(p.right, q.right); return left&&right; }
0 0
- 【Leetcode】Same Tree (Tree Judge)
- Leetcode - Tree - Same Tree
- [leetcode][tree] Same Tree
- 【Leetcode】Symmetric Tree (Tree Judge)
- [LeetCode] Same Tree、Symmetric Tree
- LeetCode-Same Tree & Symmetric Tree
- Symetrict Tree / Same Tree - LeetCode
- LeetCode-- Same Tree & Symmetric 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
- 第九周项目一(do-while语句)
- 有趣的机器学习:最简明入门指南
- [Erlang危机](5.1.2)CPU
- 伪目标.PHONY
- 第十一周项目6-回文、素数(输出1000以内所以素数)
- 【Leetcode】Same Tree (Tree Judge)
- windows cmd命令显示UTF8设置
- The script creates a MySQLDB user
- android 使用广播监听网络状态
- HTML5已定稿:将彻底颠覆原生应用?
- 数据结构之归并排序(递归实现)
- 关于计算机视觉的随谈
- 机器学习问题的十个实例
- C++读书笔记