leetcode 100. Same Tree

100. Same Tree

 

Add to List

QuestionEditorial Solution

 My Submissions

• Total Accepted: 175177
• Total Submissions: 387549
• Difficulty: Easy
• Contributors: Admin

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;        }        boolean le = isSameTree(p.left,q.left);        boolean ri = isSameTree(p.right,q.right);        return le&&ri;    }}