首页 > 代码库 > 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.
解题思路:直接DFS。
代码:
/** * 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; int leftLength = 0; int rightLength = 0; if(root->left != NULL) leftLength = maxDepth(root->left); if(root->right != NULL) rightLength = maxDepth(root->right); if(rightLength > leftLength) return rightLength + 1; else return leftLength + 1; } };
LeetCode:Maximum Depth of Binary Tree
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。