【LeetCode】 100. Same Tree

来源:互联网 发布:虾米音乐淘宝登陆不了 编辑:程序博客网 时间:2024/05/29 04:44

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


0 0
原创粉丝点击