【剑指offer】求二叉树的深度

/**
 * 二叉树的深度
 * {@link # MultiLineTree.java}
 */
public class DeepTree {

    public int TreeDepth(TreeNode root) {
        if (root == null) return 0;
        int deepLength = 0;//深度

        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);

        while (!queue.isEmpty()) {
            deepLength++;//深度+1
            int size = queue.size();
            //一次遍历二叉树的一行
            for (int i = 0; i < size; i++) {
                TreeNode node = queue.poll();
                if (node != null) {
                    if (node.left != null) {
                        queue.offer(node.left);
                    }
                    if (node.right != null) {
                        queue.offer(node.right);
                    }
                }
            }

        }
        return deepLength;
    }
}