
/*** 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 max = 0;int treeDepth(TreeNode* root) {if(root == NULL) return 0;return max(treeDepth(root->left), treeDepth(root->right)) + 1;}};
