1

Java二叉树合并与遍历

最新推荐文章于 2025-02-05 20:23:43 发布

原创最新推荐文章于 2025-02-05 20:23:43 发布 · 96 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个使用Java实现的二叉树节点合并及遍历方法。通过定义TreeNode类来构造二叉树，实现了两个二叉树的节点值相加合并，并展示了如何遍历合并后的二叉树。代码中包含了二叉树节点的创建、合并和遍历的具体实现。

public class HelloWorld{
 public static class TreeNode {
      int val;
      TreeNode left;
      TreeNode right;
      TreeNode(int x) { val = x; }
  }
     public static void main(String []args){
        System.out.println("Hello World");
        TreeNode t1=new TreeNode(1);
        t1.left=new TreeNode(3);
        t1.right=new TreeNode(2);
        t1.left.left=new TreeNode(5);
        TreeNode t2=new TreeNode(2);
        t2.left=new TreeNode(1);
        t2.right=new TreeNode(3);
        t1.left.right=new TreeNode(5);
        t1.left.left=null;
        t2.right.right=new TreeNode(7);
        t2.right.left=null;
        TreeNode root=mergeTrees(t1,t2);
        //bianli(t2);
     }
     public static void bianli(TreeNode t2)
     {
         if(t2!=null)
         {
             System.out.println(t2.val);
             bianli(t2.left);
             bianli(t2.right);
         }
     }
     public static TreeNode mergeTrees(TreeNode t1, TreeNode t2) {
        TreeNode root=t2;
        if(t1!=null||t2!=null)
        {
            root=fun(t1,t2);
            root.left=fun(t1.left,t2.left);
            root.right=fun(t1.right,t2.right);
            System.out.println("Hello World&&&&&&&&&&&&");
        }
        return root;
    }
    public static TreeNode fun(TreeNode t1, TreeNode t2) {
        TreeNode root=t1;
        if(t1!=null||t2!=null)
        {
            if(t1==null)
            {
                root.val=t2.val;
            }
            else if(t2==null)
            {
                root.val=t1.val;
            }
            else
            {
                root.val=t1.val+t2.val;
            }
        }
        return root;
    }
}