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.

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     int val;
 *     TreeNode left;
 *     TreeNode right;
 *     TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    private int depth = 1,tmpDepth = 1;
    public int maxDepth(TreeNode root) {
        
        if(root == null) return 0;
        if(root.left !=null){
            tmpDepth++;
            if(tmpDepth>depth) depth = tmpDepth;
            maxDepth(root.left);
        }
        if(root.right != null){
            tmpDepth++;
            if(tmpDepth>depth) depth = tmpDepth;
            maxDepth(root.right);
        }
        tmpDepth--;
        return depth;
    }
}