Skip to main content

Lab 7: Binary Trees

You will be submitting this lab to Gradescope.

Objectives:

The main goals for this lab are:

  1. Get practice with binary trees
  2. Get more practice using checkstyle, JUnit, and implementing an interface

Exercise 1 - LinkedBinaryTree (Binary Search Tree)

Download the LabBinaryTree interface from
wget https://raw.githubusercontent.com/BMC-CS-151/BMC-CS-151.github.io/main/labs/lab07/LabBinaryTree.java.

Implement a LinkedBinaryTree that implements LabBinaryTree. Start with the methods size, isEmpty, insert, and toString, which creates a string representation of the tree by traversing through the nodes of the binary tree in in-order traversal order. insert allows you to add to the tree and toString() allows you to check the contents of your tree.
size returns the number of nodes in the tree.

The tree should be a Binary Search Tree. It should maintain the BST properties we discussed in class: At each node with value k:

Hint: you may find it useful to use private helper methods that are called from the publicly defined method in the interface.

Note that the interface requires that all listed methods be implemented, but for now you can just implement method stubs for the remaining methods and come back to them later in the lab.

Exercise 2 - Testing

In a file called TestLinkedBinaryTree.java, write JUnit tests test your methods. Remember to thorougly test each method.

Exercise 3 - contains and height

Proceed with implementing and testing contains and height. The height of a tree with no root should be -1. Then, write JUnit tests in TestLinkedBinaryTree.java to make sure they work correctly.

Summary

In this lab we covered binary trees. You gained more experiece using checkstyle, unit testing, and implementing an interface.

Signing out

You do not need to be signed out by a TA for this lab. You will be submitting your code on Gradescope as part of HW05.