LeetCode: Maximum Depth of Binary Tree

一次过，超简单

/**
 * Definition for binary tree
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int dfs(TreeNode *root, int dep) {
        if (!root) return dep;
        return max(dfs(root->left, dep+1), dfs(root->right, dep+1));
    }
    int maxDepth(TreeNode *root) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        return dfs(root, 0);
    }
};

 C#

/**
 * Definition for a binary tree node.
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left;
 *     public TreeNode right;
 *     public TreeNode(int x) { val = x; }
 * }
 */
public class Solution {
    public int dfs(TreeNode root, int dep) {
        if (root == null) return dep;
        return Math.Max(dfs(root.left, dep+1), dfs(root.right, dep+1));
    }
    public int MaxDepth(TreeNode root) {
        return dfs(root, 0);
    }
}