找到当前树的左树的高度和右树的高度比较取最大值 + 1
/**
* Definition for a binary tree node.
* public class TreeNode {
* int val;
* TreeNode left;
* TreeNode right;
* TreeNode() {}
* TreeNode(int val) { this.val = val; }
* TreeNode(int val, TreeNode left, TreeNode right) {
* this.val = val;
* this.left = left;
* this.right = right;
* }
* }
*/
//获取二叉树的高度
/*
* 找到当前树的左树的高度和右树的高度取最大值 + 1
* */
class Solution {
public int