Java生成满二叉树，并给每个节点赋值_java实现满二叉树-优快云博客

本文链接：https://blog.youkuaiyun.com/qftyui1/article/details/131543289

该文章提供了一个Java类`Node<T>`来定义二叉树的节点，包括值、父节点和子节点的属性以及相关的方法。然后，通过`TreeTest`类的`initTree`方法展示了如何初始化一个满二叉树，递归地创建节点并设置它们的父节点和值。

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

定义节点

public class Node<T> {
    private T val;
    private Node<T> parent;
    private Node<T> leftChild;
    private Node<T> rightChild;
    public T getVal() {
        return val;
    }
    public void setVal(T val) {
        this.val = val;
    }
    public Node<T> getParent() {
        return parent;
    }
    public void setParent(Node<T> parent) {
        this.parent = parent;
    }
    public Node<T> getLeftChild() {
        return leftChild;
    }
    public void setLeftChild(Node<T> leftChild) {
        this.leftChild = leftChild;
    }
    public Node<T> getRightChild() {
        return rightChild;
    }
    public void setRightChild(Node<T> rightChild) {
        this.rightChild = rightChild;
    }
}

生成满二叉树代码

public class TreeTest<T> {
    public static void main(String[] args) {
        TreeTest t = new TreeTest<>();
        Node n = t.initTree(3);
    }
    private Node<T> initTree(Integer n) {
        int i = 1;
        int level = 1;
        Node node = new Node<>();
        node.setVal(i);
        handle(node,i,level,n);
        return node;
    }

    private int handle(Node parent, int i, int level, Integer n) {
        level++;
        Node left = new Node<>();
        Node right = new Node<>();
        parent.setLeftChild(left);
        parent.setRightChild(right);
        left.setParent(parent);
        left.setVal(++i);
        right.setParent(parent);
        right.setVal(++i);
        if(n == level) {
            return i;
        }
        i = handle(left, i,level,n);
        i = handle(right, i,level,n);
        return i;
    }
}