LeetCode: Depth of Binary Tree

Problem:

Given a binary tree, find its depth (maximum height).

递归求解。

/** * 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 maxHeight(TreeNode *root) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        if (root == NULL) return 0;                int left = maxHeight(root->left) + 1;        int right = maxHeight(root->right) + 1;        return left > right ? left : right;    }};