Minimum Depth of Binary Tree

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.

 

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
	public int minDepth(TreeNode root) {
		if (root == null) {
			return 0;
		}
		int dep = 1;
		LinkedList<TreeNode> linkedList = new LinkedList<TreeNode>();
		linkedList.add(root);
		int cur = 1;
		int next = 0;
		while (!linkedList.isEmpty()) {
			TreeNode poll = linkedList.poll();
			cur--;
			if (poll.left == null && poll.right == null) {
				return dep;
			}
			if (poll.left != null) {
				linkedList.add(poll.left);
				next++;
			}
			if (poll.right != null) {
				linkedList.add(poll.right);
				next++;
			}
			if (cur == 0) {
				cur = next;
				next = 0;
				dep++;
			}
		}
		return dep;
	}
}