求樹的深度，簡單題
/** * 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 depth(TreeNode* root){ if(root == NULL) return 0; if(root -> left == NULL && root -> right == NULL) return 1; return max(depth(root -> left), depth(root -> right)) + 1; } int maxDepth(TreeNode* root) { return depth(root); }新聞熱點
疑難解答
