static class TreeNode{
private int val;
private TreeNode left;
private TreeNode right;
public TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
@Override
public String toString() {
return "TreeNode{" +
"val=" + val +
", left=" + left +
", right=" + right +
'}';
}
}
//深度优先获取二叉树最小深度
public static void main(String[] args) {
TreeNode node7 = new TreeNode(7, null, null);
TreeNode node6 = new TreeNode(6, node7, null);
TreeNode node5 = new TreeNode(5, null, null);
TreeNode node4 = new TreeNode(4, null, null);
TreeNode node3 = new TreeNode(3, node6, null);
TreeNode node2 = new TreeNode(2, node4, node5);
TreeNode node1 = new TreeNode(1, node2, node3);
System.out.println(minDepth(node1));
}
private static int minDepth(TreeNode node1) {
if (node1 == null) {
return 0;
}
if (node1.left == null && node1.right == null) {
return 1;
}
int min = Integer.MAX_VALUE;
if (node1.left != null) {
min = Math.min(minDepth(node1.left), min);
}
if (node1.right != null) {
min = Math.min(minDepth(node1.right), min);
}
return min + 1;
}