[Leetcode] Balanced Binary Tree
问题：给一个二叉树，写一个算法判断这个树是不是balanced。 Solution #1. 第一次遇到这个问题时我的解法，如下： 写了一个getDepth()函数，访问每个节点都要调用一次这个函数。这个Solution也通过了leetcode的验证程序，但是后来想了想，I ...
原文：LeetCode Balanced Binary Tree
Given a binary tree, determine if it is height balanced. For this problem, a height balanced binary tree is defined as a binary tree in which the depth of the two subtrees ofeverynode never differ by ...
2012-10-27 22:40 5 4228 推荐指数：
相关推荐
[leetcode]Balanced Binary Tree @ Python
原题地址：http://oj.leetcode.com/problems/balanced-binary-tree/ 题意：判断一颗二叉树是否是平衡二叉树。 解题思路：在这道题里，平衡二叉树的定义是二叉树的任意节点的两颗子树之间的高度差小于等于1。这实际上是AVL树的定义。首先要写一个计算 ...
[面试真题] LeetCode：Balanced Binary Tree
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as a binary tree in which ...
[LeetCode] Balanced Binary Tree 平衡二叉树
Given a binary tree, determine if it is height-balanced. For this problem, a height-balanced binary tree is defined as: a binary tree ...
110Balanced Binary Tree
for binary tree * struct TreeNode { * int val; ...
[LeetCode] Validate Binary Search Tree
Given a binary tree, determine if it is a valid binary search tree (BST). Assume a BST is defined as follows: The left subtree of a node ...
LeetCode:Recover Binary Search Tree
其他LeetCode题目欢迎访问：LeetCode结题报告索引 题目链接 Two elements of a binary search tree (BST) are swapped by mistake. Recover the tree without changing its ...
LeetCode Binary Tree Inorder Traversal
Given a binary tree, return the inorder traversal of its nodes' values. For example:Given binary tree {1,#,2,3}, 非递归版本： 用一个栈来模拟递归的情况， 首先思考inorder ...