计算二叉树高度的三种方法

  递归 public class 递归 { class TreeNode{ int val; TreeNode left; TreeNode right; public TreeNode(int value){ this.val=value; } } public int getHeight(TreeNode root){ if(root==null){

>>阅读原文<<