随笔分类 -  二叉树

摘要:public boolean IsBalanced_Solution(TreeNode root) { if(root == null) return true; int left = getDepth(root.left); int right = getDepth(root.right); if(Math.abs(left-ri... 阅读全文
posted @ 2016-09-01 10:32 樱圃 阅读(153) 评论(0) 推荐(0)