Binary Search Trees ( Due 15 Apr 2018 )

In this assignment you will be adding to the classes Node and Tree that we developed in class and testing them. There are several short methods that you will have to write.

Write a method is_similar() that takes as input two binary trees and returns true if the nodes have the same key values and are arranged in the same order and false otherwise. 

def is_similar (self, pNode):

Write a method print_level() that takes as input the level and prints out all the nodes at that level. If that level does not exist for that binary search tree it prints nothing. Use the convention that the root is at level 1. 

def print_level (self, level):

Write a method get_height() that returns the height of a binary search tree. Recall that the height of a tree is the longest path length from the root to a leaf. 

def get_height (self):

Write a method num_nodes() that returns the number of nodes in the left subtree from the root and the number of nodes in the right subtree from the root and the root itself. This function will be useful to determine if the tree is balanced. 

def num_nodes (self):

In this assignment you will be writing helper methods for the Tree class that we developed and test them. The following is the outline of the code that you will be submitting. You may include the other functions that we developed for completeness. 

class Node (object):
  ...

class Tree (object):
  # Returns true if two binary trees are similar
  def is_similar (self, pNode):

  # Prints out all nodes at the given level
  def print_level (self, level): 

  # Returns the height of the tree
  def get_height (self): 

  # Returns the number of nodes in the left subtree and
  # the number of nodes in the right subtree and the root
  def num_nodes (self):

def main():
    # Create three trees - two are the same and the third is different

    # Test your method is_similar()

    # Print the various levels of two of the trees that are different

    # Get the height of the two trees that are different

    # Get the total numbe of nodes a binary search tree

In the class TestBinaryTree you will create several trees and show convincingly that your methods are working. For example you can create a tree by inserting the following integers in this order: 50, 30, 70, 10, 40, 60, 80, 7, 25, 38, 47, 58, 65, 77, 96. There should be enough documentation in your code that explains to the student assistants what you are testing and how.

The file that you will be turning in will be called TestBinaryTree.py. The file will have a header of the following form: 

#  File: TestBinaryTree.py

#  Description:

#  Student Name:

#  Student UT EID:

#  Partner Name:

#  Partner UT EID:

#  Course Name: CS 313E

#  Unique Number: 

#  Date Created:

#  Date Last Modified:
For this assignment you may work with a partner. If you do, both of you must read the paper on Pair Programming and submit a single copy of the program. If you are doing this assignment by yourself, then remove the Partner Name and Partner UT EID from the header.

Use the Canvas system to submit your TestBinaryTree.py file. We should receive your work by 11 PM on Sunday, 15 Apr 2018. There will be substantial penalties if you do not adhere to the guidelines. Remember Python is case sensitive. The name of your file must match exactly what we have specified.