LeetCode-Easy刷题(21) Maximum Depth of Binary Tree
Posted 当以乐
tags:
篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了LeetCode-Easy刷题(21) 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.
找出二叉树的最大深度.
public int maxDepth(TreeNode root)
if(root ==null)
return 0;
return Math.max(maxDepth(root.left), maxDepth(root.right)) +1;
以上是关于LeetCode-Easy刷题(21) Maximum Depth of Binary Tree的主要内容,如果未能解决你的问题,请参考以下文章
LeetCode-Easy刷题(31) Single Number