Description

Binary Search Trees

PROGRAMMING
For this assignment, you will implement a binary search tree that can store any arbitrary struct in its nodes. You will start by completing the recursive implementation of the binary search tree (BST) in Worksheet 29. You will then modify it to so it can store arbitrary structures at each node, provided you have a an implementation of a compare and print_type function for that structure.
We are providing you with the following files:
bst.c – This is the file in which you’ll finish implementing the unfinished BSTree implementation. There is
a main function in this file that you should modify to exercise your BST. The file contains several test cases such as testAddNode, testContainsBSTree, testLeftMost, testRemoveLeftMost, and testRemoveNode. Your implementation must pass all these test cases, and you are strongly encouraged to add your own tests as well. bst.h – This file should not be changed. structs.h – This file can be extended to test your code with different data types. compare.c- Put your compare and print functions in here. makefile.txt – Remember to rename this file to makefile (without the .txt extension).
Worksheet 29 will get you started on your implementation. However, there is one function not mentioned in the worksheet. You will be using the compare function to test two values of a node to determine if one is less than, greater than, or equal to the other. This function is similar to the compareTo function in the Comparable interface in Java. Rather than embedding it into the data structure, as you would do in Java, we will declare it and assume that the user has provided an implementation of compare in the file compare.c. That way, the user can substitute an appropriate compare function for any data type that they plan to store in the tree.
For example, if you want to store doubles in your tree, you might define the following struct to store at each node.
struct data { double num;
}
And then define your compare function to simply compare the two structs based on the num field. However, a user of your data structure could also do the following:
struct pizza {
double cost; int numToppings; char *name;
}
And define a compare function that compares pizzas based on their name, cost, or number of toppings.
In this assignment, the TYPE macro is set to void*. This means that the type of value stored in a node is a void pointer, which means it can be a “pointer to anything”. Whenever you dereference a void pointer, you must cast it to a specific type. For example, you can cast a void pointer to struct data* (see the definition in structs.h), then dereference it to get the struct data value the pointer points to. It is the programmer’s responsibility to ensure that they cast the void pointer to the same type of value that was actually stored at that location. You should read up on void pointers in your C reference or on the internet.
The compare function is needed because we need some way to compare the values stored in the tree nodes. Note that we can’t just compare the pointers with the >, <, or == operations since this would just compare the memory addresses the pointers point to. Instead, we want to compare some field of the struct that the pointer points to (e.g. val->number < otherVal->number). The compare function will make changing this function for different structs much easier.
Finally, we strongly recommend that you add to the main function to exercise your binary search tree by adding, removing, and testing for elements.
CS261 Programming Assignment 4
QUESTIONS
Question 1
Question 2
The trouble with binary search trees is that they can become unbalanced depending on the order that you insert values. Give an order for inserting the numbers 1 through 7 such that the resulting tree is a full binary search tree. This problem does not require you to fill in a tree, just write down the order in which you would insert the values. (Hint: it might be helpful to first draw the full tree to figure out how the values must be arranged, then you can determine the order to add them!)
Question 3
Part A: Given the following tree, question3.pdf, show the tree after removing the value 42.
Part B: Using the tree produced by Part A, show the tree after removing the value 19.
Question 4
The computer has built the following decision tree for the Guess the Animal Game, question4.pdf. The player has an animal in mind and will answer the questions shown in the tree. Each of the players responses is used to determine the next question to ask. For example, if the player is thinking of a sea turtle, she would answer Yes to the first (top) question, “does it live in the water?”, which leads to the second question “is it a mammal?”, to which she would answer No.
Show the decision tree that the computer should build after adding a Zergling and a question to differentiate it, “Does it eat space marines?”, to the tree. The question and the animal should be added below existing questions in the tree. Note that Zerglings do eat space marines , do not live in the water, do not climb trees, and are not mammals (just in case you didn’t know :-))
GRADING RUBRIC
Programming
Compile/Style = 15 struct Node *_addNode(struct Node *cur, TYPE val) = 15 int containsBSTree(struct BSTree *tree, TYPE val) = 10 TYPE _leftMost(struct Node *cur) = 10 struct Node *_removeLeftMost(struct Node *cur) = 10 struct Node *_removeNode(struct Node *cur, TYPE val) = 15 compare.c = 5 Questions
Question 1 = 5
Question 2 = 5
Question 3 = 5
Question 4 = 5
What to turn in via TEACH AND CANVAS –
bst.c compare.c struct.h ( if you have changed it ) answers.pdf (if you printed off the trees, please scan your answers)