Java根据深度构建一个满二叉树

Java根据深度构建一个满二叉树

public class FullBinaryTreeNode<E> {

    public static void main(String[] args) {
        FullBinaryTreeNode<Integer> root = new FullBinaryTreeNode<>(new FullBinaryTreeNode<>(),null,null);
        // 深度为3
        root.buildFullBinaryTree(root,3);
        System.out.println(root);
    }
	// 递归构建子节点
    public void buildFullBinaryTree(FullBinaryTreeNode<E> parent, int depth) {
        if (depth <= 1) {
            return;
        }
        FullBinaryTreeNode<E> leftNode = parent.getLeftNode();
        FullBinaryTreeNode<E> rightNode = parent.getRightNode();
        if (leftNode == null) {
            leftNode = new FullBinaryTreeNode<>(parent,null,null);
            parent.setLeftNode(leftNode);
            buildFullBinaryTree(leftNode,depth-1);
        }
        if (rightNode == null) {
            rightNode = new FullBinaryTreeNode<>(parent,null,null);
            parent.setRightNode(rightNode);
            buildFullBinaryTree(rightNode,depth-1);
        }
    }

    private E node;

    private FullBinaryTreeNode<E> root;

    private FullBinaryTreeNode<E> leftNode;

    private FullBinaryTreeNode<E> rightNode;

    public FullBinaryTreeNode() {
    }

    public FullBinaryTreeNode(FullBinaryTreeNode<E> root, FullBinaryTreeNode<E> leftNode, FullBinaryTreeNode<E> rightNode) {
        this.root = root;
        this.leftNode = leftNode;
        this.rightNode = rightNode;
    }

    public E getNode() {
        return node;
    }

    public void setNode(E node) {
        this.node = node;
    }

    public FullBinaryTreeNode<E> getRoot() {
        return root;
    }

    public void setRoot(FullBinaryTreeNode<E> root) {
        this.root = root;
    }

    public FullBinaryTreeNode<E> getLeftNode() {
        return leftNode;
    }

    public void setLeftNode(FullBinaryTreeNode<E> leftNode) {
        this.leftNode = leftNode;
    }

    public FullBinaryTreeNode<E> getRightNode() {
        return rightNode;
    }

    public void setRightNode(FullBinaryTreeNode<E> rightNode) {
        this.rightNode = rightNode;
    }
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值