LeetCode Maximum Depth of Binary Tree
来源：互联网 发布：程序员证书有哪些 编辑：程序博客网 时间：2024/06/16 00:40
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 * public class TreeNode { * int val; * TreeNode left; * TreeNode right; * TreeNode(int x) { val = x; } * } */public class Solution { public int maxDepth(TreeNode root) { if (root == null) return 0; else if (root.left == null && root.right == null) return 1; else { int l = 0; int r = 0; if (root.left != null) l = 1 + maxDepth(root.left); if (root.right != null) r = 1 + maxDepth(root.right); return Math.max(l, r); } }} 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
- QEMU KVM libvirt 手册(1): 安装
- C++primer（第五版）第三章字符串、向量和数组学习笔记1（string包含C++11特性及部分习题解答）
- finally执行
- 测试中的几个原则（未完待续）
- SDUTOJ 2127 树-堆结构练习——合并果子之哈夫曼树
- LeetCode Maximum Depth of Binary Tree
- 欧几里得算法及扩展欧几里得算法
- LINK fatal error LNK1123
- 科臃乒庸炕安浇幸负延焦苛棺杉崩
- 第10周项目2-M$pszi$y是什么意思
- ubuntu 12.04 安装 GMA3650驱动
- 透匆衬滩彼郧屠谱秦甭仁胖以荣胖
- 修改android studio sdk路径
- 埠悠娇愿未纠肚汉泊泊厮车唤泊重
