对称二叉树

最新推荐文章于 2024-11-12 15:33:11 发布

街道口afs

最新推荐文章于 2024-11-12 15:33:11 发布

阅读量140

点赞数

CC 4.0 BY-SA版权

分类专栏：算法题目

本文链接：https://blog.youkuaiyun.com/xiaoYuDAxiao/article/details/95472511

算法题目专栏收录该内容

14 篇文章

订阅专栏

博客围绕对称二叉树展开，虽无具体内容，但可知核心为对称二叉树，这是数据结构中的重要概念，在信息技术领域有广泛应用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

package com.company;

public class TreeMirror {

    static class BinaryTreeNode{

        int value ;
        BinaryTreeNode left = null;
        BinaryTreeNode right = null;
        public BinaryTreeNode(int value){
            this.value = value;
        }
    }

    public static void main(String[] args){
        BinaryTreeNode node = new BinaryTreeNode(1);
        BinaryTreeNode node2 = new BinaryTreeNode(2);
        BinaryTreeNode node3 = new BinaryTreeNode(2);
        BinaryTreeNode node4 = new BinaryTreeNode(3);
        BinaryTreeNode node5 = new BinaryTreeNode(3);
        BinaryTreeNode node6 = new BinaryTreeNode(3);
        BinaryTreeNode node7 = new BinaryTreeNode(3);
        node.left = node2;
        node.right = node3;
        node2.left = node4;
        node2.right = node5;
        node3.left = node6;
        node3.right = node7;

        boolean isMirror = isMirror(node);
        System.out.println("node is mirror "+isMirror);

    }

    public static boolean isMirror(BinaryTreeNode node){
        return isMirror(node.left,node.right);
    }

    public static boolean isMirror(BinaryTreeNode left, BinaryTreeNode right){
        if(left == null && left == null ){
            return true;
        }
        if(left == null || right == null ){
            return false;
        }
        if(left.value != right.value){
            return false;
        }
        return isMirror(left.left,right.right) && isMirror(left.right, right.left);

    }
}