package com.qiye;
import java.util.LinkedList;
import java.util.Queue;
class TreeNode {
int val = 0;
TreeNode left = null;
TreeNode right = null;
}
public class Solution2 {
/**
* 递归求解
* 返回树的高度
* @param root TreeNode类 树根节点
* @return int整型
*/
public int getTreeHeight1 (TreeNode root) {
if(root == null){
return 0;
}
int left = getTreeHeight1(root.left);
int right = getTreeHeight1(root.right);
return left > right? left + 1 : right + 1;
}
/***
* 非递归求解
* @param root
* @return
*/
public int getTerrHeight(TreeNode root){
if(root == null){
return 0;
}
//使用count进行层级统计。<