求二叉樹的最大深度和最小深度以及之間的差

maxheight函數就是求二叉樹的左子樹與右子樹中那個深度最大最大深度多少，minheight函數就是求二叉樹的左子樹與右子樹中那個深度最小最小深度多少，Isbalance函數就是求左子樹與右子樹的深度差，只要不大於1就是平衡二叉樹。平衡二叉樹:它是一 棵空樹或它的左右兩個子樹的高度差的絕對值不超過1，並且左右兩個子樹都是一棵平衡二叉樹。        static void Main(string[] args)        {            Node root = new Node();            Node c1 = new Node();            Node c2 = new Node();            root.left = c1;            root.right = c2;            Node c11 = new Node();            c1.left = c11;            Node c112 = new Node();            c11.right = c112;            Program p = new Program();            Console.WriteLine(p.isBalanced(root));            Console.Read();        }        public int GetMaxHeight(Node root)        {            if (root == null)                return 0;            int max = 1 + Math.Max(this.GetMaxHeight(root.left), this.GetMaxHeight(root.right));            return max;        }        public int GetMinHeight(Node root)        {            if (root == null)                return 0;            int min = 1 + Math.Min(this.GetMinHeight(root.left), this.GetMinHeight(root.right));            return min;        }        public bool isBalanced(Node root)        {            int max = this.GetMaxHeight(root);            int min = this.GetMinHeight(root);            if (max - min > 1)                return false;            else                return true;        }    }    public class Node    {        public int value;        public Node left;        public Node right;    }