Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.
/** * 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 maxDepth(TreeNode *root) { if(root==NULL) return 0; if(root->left==NULL) return maxDepth(root->right)+1; else if(root->right==NULL) return maxDepth(root->left)+1; else return max(maxDepth(root->left),maxDepth(root->right))+1; }};新聞熱點(diǎn)
疑難解答
圖片精選
網(wǎng)友關(guān)注
