1. 題目

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.

2. 思路

遞歸到左、右子樹的max值，+1.

3. 代碼

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

總結(jié)

以上是生活随笔為你收集整理的【leetcode】104. Maximum Depth of Binary Tree的全部?jī)?nèi)容，希望文章能夠幫你解決所遇到的問(wèn)題。

如果覺(jué)得生活随笔網(wǎng)站內(nèi)容還不錯(cuò)，歡迎將生活随笔推薦給好友。