leetcode 100. Same Tree

来源:互联网 发布:cnc手工编程宏程序 编辑:程序博客网 时间:2024/05/25 19:56

题目内容
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. * 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(q.right,p.right);    }}
0 0