二叉树遍历-层序-递归

层序遍历：按照层级，从上往下，从左到右。使用广度优先搜索算法。

定义一棵二叉树，遍历逻辑按照图中的层级依次进行遍历

按照层级划分，二叉树分为四级，如果把没有节点的用null节点进行填充，那么二叉树将变更为下图

此时我们发现二叉树有两个规律。

规律一：每一个层级的节点数为二的n次方（）n从0开始

规律二：定义下标遍历i,那么左边节点是上一级节点下标的2*i,右边的下标为2*i+1，以规律二为例

算法代码实现

节点类

package com.hx;

/**
 * 二叉树节点对象类
 */
public class TreeNode {

    public TreeNode left;//左节点
    public TreeNode right;//右节点
    public int val; //节点值
    public int deep; //树深度

    public TreeNode(TreeNode left, TreeNode right) {
        this.left = left;
        this.right = right;
    }

    public TreeNode(int val, TreeNode left, TreeNode right) {
        this.left = left;
        this.right = right;
        this.val = val;
    }

}

算法代码实现

package com.hx;

import java.util.ArrayList;
import java.util.Arrays;

public class BinaryTree {


    /**
     * 二叉树遍历-层序遍历递归
     * @param root
     * @param i 下标
     * @param list 遍历结果列表
     */
    public static void levelOrder(TreeNode root, int i, ArrayList list) {
        if(root == null) {
            return;
        }
        int size = list.size();
        if(size <= i) {
            for(int j = 0; j <= i-size; j++) {
                list.add(j+size,null);
            }
        }
        list.set(i,root.val);
        levelOrder(root.left,2*i,list);
        levelOrder(root.right,2*i+1,list);
    }

    public static void main(String[] args) {
        TreeNode node7 = new TreeNode(7,null, null);
        TreeNode node6 = new TreeNode(6,null, null);
        TreeNode node5 = new TreeNode(5,node6, node7);
        TreeNode node4 = new TreeNode(4,null, null);
        TreeNode node3 = new TreeNode(3,null, null);
        TreeNode node2 = new TreeNode(2,node4, node5);
        TreeNode node1 = new TreeNode(1,node2, node3);
        ArrayList list = new ArrayList();
        levelOrder(node1,1,list);
        System.out.println(Arrays.toString(list.toArray()));
    }
}

执行结果

如果按照不填充null节点的方式，直接过滤掉list中null的元素即可 

   public static void main(String[] args) {
        TreeNode node7 = new TreeNode(7,null, null);
        TreeNode node6 = new TreeNode(6,null, null);
        TreeNode node5 = new TreeNode(5,node6, node7);
        TreeNode node4 = new TreeNode(4,null, null);
        TreeNode node3 = new TreeNode(3,null, null);
        TreeNode node2 = new TreeNode(2,node4, node5);
        TreeNode node1 = new TreeNode(1,node2, node3);
        ArrayList<Integer> list = new ArrayList<Integer>();
        levelOrder(node1,1,list);     
        System.out.println(Arrays.toString(list.stream().filter(Objects::nonNull)
        .toArray()));
    }