高度平衡性检查

给定一个整数树，检查它是否高度平衡，返回一个布尔值。

搜索树属性的测试

给定一个整数树，写一个方法，返回一个布尔值，表示是否是一个二进制搜索树。

高度平衡插入

为二进制搜索树编写修改版本的插入方法，以便它保持树的高度平衡性。你应该假定输入树是高度平衡的，并产生一个高度平衡的树。

该方法应在（日志）时间内工作。

你可以使用issearchtree和isheightbalanced方法Assert语句来验证您的代码是正确的。

高度平衡删除

为二进制搜索树（在工作表1中所做）的删除方法编写一个修改版本，以便保持树的高度平衡性。你应该假定输入树是高度平衡的，并产生一个高度平衡的树。

该方法应在（日志）时间内工作。-Checking for height-balanced property

　 Given a tree of integers a, check to see if it is height-balanced, returning a boolean value.

Test for the search tree property

Given a tree of integers a, write a method that returns a boolean value indicating whether a is a binary search tree.

Insertion with height-balancing

　Write modified version of the insert method for binary search trees so that it maintains the height- balanced property of trees. You should assume that the input tree is height-balanced and produce a height-balanced tree again.

The method should work in O(log n) time.

You may use the isSearchTree and isHeightBalanced methods in assert statements to verify that your code works correctly.

Deletion with height-balancing

Write a modified version of the delete method for binary search trees (done in Worksheet 1) so that it maintains the height-balanced property of trees. You should assume that the input tree is height-balanced and produce a height-balanced tree