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.
Note: A leaf is a node with no children.
Example:
Given binary tree [3,9,20,null,null,15,7],
3
/
9 20
/
15 7
return its depth = 3.

求二叉树的深度

实现

• scala

1
2
3
4

def (root: TreeNode): Int = {
         if (root == null) return 0
     Math.max(maxDepth(root.left), maxDepth(root.right)) + 1
    }

参考

• Maximum Depth of Binary Tree

如有错误,欢迎批评指正,望不吝赐教!!!