今天在leecode测试了一个简单的算法题,计算二叉树最大高度
Givn 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.
/**
* 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;
}
int left = maxDepth(root.left)+1;
int right = maxDepth(root.right)+1;
if(left>right){
return left;
}else
return right;
}
}
比较简单,后面继续练习