[LeetCode]Maximum Depth of Binary Tree
版权声明:本文为博主原创文章。未经博主同意不得转载。 https://blog.csdn.net/yeweiouyang/article/details/36216093
题目:给定一颗二叉树。求二叉树最大深度
算法:递归
原理:递归遍历二叉树,从底向上计数
/** * 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 (null == root) { return 0; } int left = maxDepth(root.left); int right = maxDepth(root.right); return (left > right ?
left+1 : right+1); } }
posted on 2019-04-05 15:08 xfgnongmin 阅读(138) 评论(0) 编辑 收藏 举报