一棵二叉树的创建过程

class TreeNode{ //树节点和链表中的节点不一样，因为树节点需要有左右节点
    int val;
    TreeNode leftNode;
    TreeNode rightNode;
    public TreeNode(int val){
        this.val = val;
    }
    //写两个节点的set方法
    public void setLeftNode(TreeNode leftNode){
        this.leftNode=leftNode;
    }
    public void setRightNode(TreeNode rightNode){
        this.rightNode=rightNode;
    }
    public void frontShow(){
        System.out.println(this.val);
        if(leftNode!=null){
            leftNode.frontShow();
        }
        if(rightNode!=null){
            rightNode.frontShow();
        }
    }

}

class BinaryTree{
    TreeNode root;
    public void setRoot(TreeNode root){
        this.root=root;
    }
    public void frontShow(){
        root.frontShow();
    }
}

public class BianLiBinary {
    public static void main(String args[]){
        //创建二叉树
        BinaryTree tree = new BinaryTree();
        //创建一个根节点，并且赋值
        TreeNode n1=new TreeNode(1);
        tree.setRoot(n1);
        TreeNode n2=new TreeNode(2);
        TreeNode n3=new TreeNode(3);
        TreeNode n4=new TreeNode(4);
        TreeNode n5=new TreeNode(5);
        TreeNode n6=new TreeNode(6);
        n1.setLeftNode(n2);
        n1.setRightNode(n3);
        n2.setRightNode(n4);
        n3.setLeftNode(n5);
        n3.setRightNode(n6);
        tree.frontShow();

    }
}