Java实现判断两颗二叉树是否相同（递归）

Java实现判断两颗二叉树是否相同

二叉树结构

class TreeNode {
    int val;
    TreeNode left;
    TreeNode right;
    TreeNode() {}
    TreeNode(int val) { this.val = val; }
    TreeNode(int val, TreeNode left, TreeNode right) {
        this.val = val;
        this.left = left;
        this.right = right;
    }
}

判断方法

private static boolean isSameTree(TreeNode p, TreeNode q) {
        if (p == null && q == null)
            return true;
        if (p != null && q != null && p.val == q.val)
            return isSameTree(p.left, q.left) && isSameTree(p.right, q.right);
        else
            return false;
    }

main方法

public static void main(String[] args) {

        long startTime = System.currentTimeMillis();    //获取开始时间

        TreeNode tree1 = new TreeNode(2);
        TreeNode tree2 = new TreeNode(3);
        TreeNode tree3 = new TreeNode(1, tree1, tree2);


        TreeNode tree4 = new TreeNode(2);
        TreeNode tree5 = new TreeNode(3);
        TreeNode tree6 = new TreeNode(1, tree4, tree5);
        System.out.println(isSameTree(tree3, tree6));

        long endTime = System.currentTimeMillis();    //获取结束时间
        System.out.println("程序运行时间：" + (endTime - startTime) + "ms");    //输出程序运行时间
    }

效果截图