leetcode 104. Maximum Depth of Binary Tree

Given a binary tree, find its maximum depth.

The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.

题目解析
求一个二叉树的树的深度。
有两种求法，深度优先（DFS）和广度优先（BFS）。

方法1，DFS

/**
 * 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;

        int left=maxDepth(root.left);
        int right=maxDepth(root.right);

        return Math.max(left,right)+1;
    }
}

方法二，BFS

public class Solution {
    public int maxDepth(TreeNode root) {
        if(root==null) return 0;

        Queue<TreeNode> que=new ArrayDeque<TreeNode>();
        que.add(root);
        int count=1;
        int Depth=0;

        while(!que.isEmpty())
        {
            TreeNode temp=que.peek();
            que.poll();
            count--;
            if (temp.left!=null) {
                que.add(temp.left);     
            }
            if (temp.right!=null) {
                que.add(temp.right);    
            }
            if (count==0) {
                Depth++;
                count=que.size();
            }
        }

        return Depth;


    }
}