104. Maximum Depth of Binary Tree - leetcode

104.Maximum Depth of Binary Tree

 

Given abinary tree, find its maximum depth.

Themaximum depth is the number of nodes along the longest path from the root nodedown to the farthest leaf node.

求一个树的最大深度，其实就是遍历二叉树的变形。 可以深度优先DFS，也可以广度优先BFS

这里采用的是广度优先，在每次遍历完这层后，将全局变量count 加1

/**
 * 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 maxDepth(TreeNode root) {
        if(root == null){
            return 0;
        }
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int count = 0;
        while(!queue.isEmpty()){
            int size = queue.size();
            while(size-- >0){
                TreeNode node = queue.poll();
                if(node.left != null){
                    queue.offer(node.left);
                }
                if(node.right != null){
                    queue.offer(node.right);
                }
            }
            count++;
        }
        return count;
         /**
         //下面这个方法让我很疑惑，明明TreeNode node = queue.poll()这个句子和上面是一样的啊，运行这个方法这句话就会报错，我也不知道为何了……
        if(root==null) {return 0;}
        int level = 0;
        Queue<TreeNode> queue = new LinkedList<>();
        queue.offer(root);
        int currentCount = 1;
        int nextCount = 0;
        //while(q != null){
        while(!queue.isEmpty())
            TreeNode node = queue.poll();
             currentCount--;
            if(node.left != null){
                queue.offer(node.left);
                nextCount++;
            }
            if(node.right != null){
                queue.offer(node.right);
                nextCount++;
            }
            if(currentCount==0){
                currentCount=nextCount;
                nextCount=0;
                level++;
            }
        }
        return level;
        */
    }
}