[LeetCode] Maximum Depth of Binary Tree
来源:互联网 发布:骑行头盔推荐 知乎 编辑:程序博客网 时间:2024/06/10 07:50
题目:
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; } return 1 + max(maxDepth(root->left), maxDepth(root->right)); }};
没什么可多说的,递归,DFS
0 0
- Leetcode - Tree - Maximum Depth of Binary Tree
- [leetcode][tree] Maximum Depth of Binary Tree
- LeetCode Maximum Depth of Binary Tree
- [Leetcode] Maximum Depth of Binary Tree
- leetcode 24: Maximum Depth of Binary Tree
- [LeetCode] Maximum Depth of Binary Tree
- Leetcode 104 Maximum Depth of Binary Tree
- 【leetcode】Maximum Depth of Binary Tree
- [leetcode]Maximum Depth of Binary Tree
- [LeetCode]Maximum Depth of Binary Tree
- [leetcode]Maximum Depth of Binary Tree
- Leetcode: Maximum Depth of Binary Tree
- LeetCode-Maximum Depth of Binary Tree
- [leetcode] Maximum Depth of Binary Tree
- LeetCode - Maximum Depth of Binary Tree
- LeetCode:Maximum Depth of Binary Tree
- LeetCode | Maximum Depth of Binary Tree
- 【leetcode】Maximum Depth of Binary Tree
- target属性
- eclipse最佳设置
- 基于Cordys C3版平台应用系统维护经验一则——Oracle数据库表空间满了
- DM8168裸机调试-GPMC+FPGA
- nginx服务器access_log日志分析及配置详解
- [LeetCode] Maximum Depth of Binary Tree
- 【Hibernate步步为营】--双向关联一对一映射详解(二)
- android Linearlayout中有关gravity与layout_gravity对布局的影响
- IP地址匹配
- cvAddWeighted( ) (转载)
- WebView调用JS失败
- Ubuntu 12.04.04 LTS server版本DHCP配置
- cvFindContours函数使用-转载
- 用CMD命令查看局域网电脑IP地址,电脑名称及MAC地址