leetcode maximum-depth-of-binary-tree 求树的深度

递归写法

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.*;
public class Solution {
    public int maxDepth(TreeNode root) {
        if(root==null) return 0;
        return 1+Math.max(maxDepth(root.left),maxDepth(root.right));
    }
}

非递归写法（BFS）

/**
 * Definition for binary tree
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
import java.util.*;
public class Solution {
    public int maxDepth(TreeNode root) {
        if(root==null) return 0;
        int res = 0;
        Queue<TreeNode> que = new LinkedList<TreeNode>();
        que.add(root);
        
        while(!que.isEmpty()){
            int size = que.size();
            while(size>0){//同一层全部输出
                TreeNode node = que.poll();
                size--;
                if(node.left!=null){
                    que.add(node.left);
                }
                if(node.right!=null){
                    que.add(node.right);
                }
            }
            res++;
        }
        return res;
    }
}