二叉树实现-初始化，层序遍历（广搜）

Java二叉树实现

初始化（满二叉树）

public static void FBTreeInit(TreeNode root, int height) {
    root.Val = 0;
    if (height == 0) {
        return;
    }
    root.Left = new TreeNode(0);
    root.Right = new TreeNode(0);
    FBTreeInit(root.Left, height - 1);
    FBTreeInit(root.Right, height - 1);
}

广度优先搜索

public static void loTraversal(TreeNode root) {
    ArrayList<TreeNode> loTArray = new ArrayList<>();
    loTArray.add(root);
    while (!loTArray.isEmpty()) {
        int length = loTArray.size();
        TreeNode node;
        for (int i = 0; i < length; i++) {
            node = loTArray.removeFirst();
            System.out.println(node.Val);
            if (node.Left != null) {
                loTArray.add(node.Left);
            }
            if (node.Right != null) {
                loTArray.add(node.Right);
            }
        }
    }
}

二叉树类代码

package TwoTree;
import java.util.ArrayList;

public class TreeNode {
    public int Val;
    public TreeNode Left = null;
    public TreeNode Right = null;

    public TreeNode() {

    }

    public TreeNode(int val) {
        this.Val = val;
    }

    // height从根节点为0开始
    public static void FBTreeInit(TreeNode root, int height) {
        root.Val = 0;
        if (height == 0) {
            return;
        }
        root.Left = new TreeNode(0);
        root.Right = new TreeNode(0);
        FBTreeInit(root.Left, height - 1);
        FBTreeInit(root.Right, height - 1);
    }

    public static void loTraversal(TreeNode root) {
        ArrayList<TreeNode> loTArray = new ArrayList<>();
        loTArray.add(root);
        while (!loTArray.isEmpty()) {
            int length = loTArray.size();
            TreeNode node;
            for (int i = 0; i < length; i++) {
                node = loTArray.removeFirst();
                System.out.println(node.Val);
                if (node.Left != null) {
                    loTArray.add(node.Left);
                }
                if (node.Right != null) {
                    loTArray.add(node.Right);
                }
            }
        }
    }
}