Skip to content

Update StudentTest.java #3

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

Update StudentTest.java #3

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
62 changes: 12 additions & 50 deletions test/StudentTest.java
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -5,8 +5,6 @@
import java.util.*;
import java.util.Random;

import static java.lang.Math.log;

public class StudentTest {

@Test
Expand All @@ -31,7 +29,7 @@ public void insertSmallBST() {
}
}

/**
/**
* TODO: Test cases
*/
@Test
Expand All @@ -41,56 +39,20 @@ public void test() {
}

/*
* Helper Methods to Validate Properties of
* BST and AVL Tree.
Helper Methods to Validate AVL Property
*/

// Check that the tree is ordered
public static void
validate_BST_property(OrderedSet<Integer> tree) {
validate_BST_property(tree.root());
}
// Check that the subtree satisfies the BST Property.
// Returns the min and max keys in the subtree of n.
public static Pair<Integer,Integer>
validate_BST_property(Location<Integer> n) {
if (n == null) {
return null;
} else {
Pair<Integer,Integer> left_range =
validate_BST_property(n.left_child());
Pair<Integer,Integer> right_range =
validate_BST_property(n.right_child());
if (left_range == null) {
left_range = new Pair<>(n.get(), n.get());
} else {
assertTrue(left_range.getValue() < n.get());
}
if (right_range == null) {
right_range = new Pair<>(n.get(), n.get());
} else {
assertTrue(n.get() < right_range.getKey());
}
return combine(left_range, right_range);
}
private static int calc_height(BinarySearchTree.Node<Integer> n) {
if (n == null) return -1;
else return 1 + Math.max(calc_height(n.left), calc_height(n.right));
}


// Check that the tree is an AVL tree.
public static <K> void validate_AVL_property(OrderedSet<K> tree) {
validate_AVL_property(tree.root());
private static boolean validate_height(BinarySearchTree.Node<Integer> n) {
if (n == null) return true;
if (Math.abs(calc_height(n.left) - calc_height(n.right)) > 1) return false;
return validate_height(n.left) && validate_height(n.right);
}
// Checks that the subtree rooted at location n is and AVL tree
// and returns the height of this subtree.
public static <K> int validate_AVL_property(Location<K> n) {
if (n == null) {
return -1;
} else {
int h1, h2;
h1 = validate_AVL_property(n.left_child());
h2 = validate_AVL_property(n.right_child());
assertTrue(Math.abs(h2 - h1) < 2);
return 1 + max(h1, h2);
}

private static void validate_height(BinarySearchTree<Integer> avl) {
assertTrue(validate_height((BinarySearchTree.Node<Integer>) avl.root));
}
}