[leetcode] 100. Same Tree 解题报告
Posted
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了[leetcode] 100. 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.
递归遍历
一刷:
public boolean isSameTree(TreeNode p, TreeNode q) { if ((p == null && q != null) || (p != null && q == null)) return false; else if (p == null && q == null) return true; else { if (p.val != q.val) { return false; } else { return ( isSameTree(p.left, q.left) && isSameTree(p.right, q.right) ); } } }
以上是关于[leetcode] 100. Same Tree 解题报告的主要内容,如果未能解决你的问题,请参考以下文章