Description: 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 tr
To Search:
File list (Check if you may need any files):
Worksheet2.java
__MACOSX
........\._Worksheet2.java
Worksheet2Verify.java
__MACOSX\._Worksheet2Verify.java
Download