/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
class Solution {
public:
    int treeDepth(TreeNode* root) {
        //树的题一般采用递归思想来解题，因为树的结构就是递归定义的
        if(!root) return 0;
        return max(treeDepth(root->left),treeDepth(root->right)) + 1;
    }
};