My java solution, use recursion


  • 0
    L

    public class Solution {
    public int maxDepth(TreeNode root) {
    if(null == root) return 0;
    if(root != null&& root.left == null&& root.right == null) return 1;
    return Math.max(maxDepth(root.left),maxDepth(root.right))+1;
    }
    }


Log in to reply
 

Looks like your connection to LeetCode Discuss was lost, please wait while we try to reconnect.