首页 > 代码库 > LeetCode: Maximum Depth of Binary Tree
LeetCode: Maximum Depth of Binary Tree
LeetCode: Maximum Depth of Binary Tree
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.
地址：https://oj.leetcode.com/problems/maximum-depth-of-binary-tree/
算法：直接递归，一遍通过。代码：
1 /** 2 * Definition for binary tree 3 * struct TreeNode { 4 * int val; 5 * TreeNode *left; 6 * TreeNode *right; 7 * TreeNode(int x) : val(x), left(NULL), right(NULL) {} 8 * }; 9 */10 class Solution {11 public:12 int maxDepth(TreeNode *root) {13 if(!root) return 0;14 int left = maxDepth(root->left);15 int right = maxDepth(root->right);16 return left > right? left + 1 : right + 1;17 }18 };
LeetCode: Maximum Depth of Binary Tree
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。