二叉树的最小深度

方法如下

package com.wxl.DichotomizationTree.thinking;

import com.wxl.DichotomizationTree.Node.Node;

public class Depth {
    /**
     * 最小深度是从根节点到最近叶子节点的最短路径上的节点数量
     * @param head
     * @return
     */
    public int minDepth1(Node head){
        if(head == null ) return 0;
        return process(head,1);
    }
    //当前节点来到的是cur,cur的深度为level
    //确保遍历到cur子树中的所有叶节点，并且将最矮的叶节点高度返回
    private int process(Node cur, int level) {
        if (cur.left==null && cur.right==null){
            return level;
        }
        int ans = Integer.MAX_VALUE;
        //如果有左树，返回cur左树上最矮页节点高度
        if (cur.left != null){
            ans = Math.min(process(cur.left,level+1),ans);
        }
        //如果有右树，返回cur右树上最矮页节点高度
        if (cur.right != null){
            ans = Math.min(process(cur.right,level+1),ans);
        }
        //返回整颗树最矮叶节点的高度
        return ans;
    }
    public static void main(String[] args){
        //构造二叉树
        Node head = createTree();
        Depth depth = new Depth();
        System.out.println("最小深度为："+depth.minDepth1(head));
    }
    private static Node createTree() {
        Node head = new Node(0);
        Node leftHead = head;
        Node rightHead = head;
        head.left = new Node(1);
        head.right = new Node(2);
        leftHead = leftHead.left;
        leftHead.left = new Node(3);
        leftHead.right = new Node(4);
        rightHead = rightHead.right;
        rightHead.left = new Node(5);
        rightHead.right = new Node(6);
        return head;
    }
}

遍历二叉树的神级方法