Minimum Depth of Binary Tree

[size=large][color=darkred][b]题目描述[/b][/color][/size]
Given a binary tree, find its minimum depth.

The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.

[size=large][color=darkred][b]解题思路[/b][/color][/size]
本题是二叉树的遍历题，但是在深度优先和广度优先上需要进行考虑。如果采用深度优先算法的话，并不能保证另一颗子树的情况，浪费时间，因此采用广度优先算法。本题还是采用两个辅助队列的方式。

[size=large][color=darkred][b]自己的代码[/b][/color][/size]

package leetcode;

import java.util.LinkedList;
import java.util.Queue;

public class MinimumDepthOfBinaryTree {
	public int minDepth(TreeNode root) {
		//处理空树
		if(root == null) return 0;

		int depth = 0;
		Queue<TreeNode> queue1 = new LinkedList<TreeNode>();
		Queue<TreeNode> queue2 = new LinkedList<TreeNode>();
		queue2.add(root);
		outer:
		while(queue2 != null){
			depth++;
			queue1.addAll(queue2);
			queue2.clear();
			while(!queue1.isEmpty()){
				TreeNode head = queue1.poll();
				if(head.left == null && head.right == null) break outer;
				if(head.left != null) queue2.add(head.left);
				if(head.right != null) queue2.add(head.right);
			}
		}
        return depth;
    }

	public static void main(String[] args) {
		TreeNode node1 = new TreeNode(0);
		TreeNode node2 = new TreeNode(0);
		TreeNode node3 = new TreeNode(0);
		TreeNode node4 = new TreeNode(0);


		node1.left = node2;
		node1.right = node3;
		node2.right = node4;

		MinimumDepthOfBinaryTree mdobt = new MinimumDepthOfBinaryTree();
		//System.out.println(mdobt.minDepth(node1));
		//System.out.println(mdobt.minDepth(null));
		System.out.println(mdobt.minDepth(node3));
	}
}