LeetCode *** 104. Maximum Depth of Binary Tree
来源：互联网 发布：天天赚钱软件下载 编辑：程序博客网 时间：2024/05/16 14:06
题目：
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.
分析：
求二叉树最长路径，用递归没得说。
代码:
/*struct TreeNode { int val; struct TreeNode *left; struct TreeNode *right; };*/int maxDepth(struct TreeNode* root) { if(root==NULL)return 0; else{ int leftNum=maxDepth(root->left)+1; int rightNum=maxDepth(root->right)+1; return leftNum>rightNum?leftNum:rightNum; }} 0 0
- [LeetCode]104.Maximum Depth of Binary Tree
- 【LeetCode】104.Maximum Depth of Binary Tree
- [Leetcode] 104. Maximum Depth of Binary Tree
- LeetCode --- 104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- leetCode 104. Maximum Depth of Binary Tree
- 104. Maximum Depth of Binary Tree LeetCode
- 104. Maximum Depth of Binary Tree LeetCode
- LeetCode 104. Maximum Depth of Binary Tree
- leetcode：104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- [LeetCode]104. Maximum Depth of Binary Tree
- leetcode 104. Maximum Depth of Binary Tree
- LeetCode 104. Maximum Depth of Binary Tree
- 【LeetCode】104. Maximum Depth of Binary Tree
- LeetCode#104. Maximum Depth of Binary Tree
- Leetcode 104. Maximum Depth of Binary Tree
- LeetCode *** 104. Maximum Depth of Binary Tree
- javaBean
- UVA 10048 Audiophobia（Floyd变形）
- java单链表基本操作（二）--指定位置增加节点
- 二叉树的非递归遍历
- 文章标题warning: could not load any Objective-C class information. This will significantly reduce the qu
- LeetCode *** 104. Maximum Depth of Binary Tree
- android面试题50道
- 扇形比例表（猜涨跌）
- Android内存优化之OOM
- 数组型Json解析之细节
- iOS 开发之照片框架详解
- 5 个免费的受欢迎的 SQLite 管理工具
- 用C语言进行CGI程序设计
- leetcode 191. Number of 1 Bits
