Due date has passed, but you can still Post Solution.
Create a Binary Search Tree using the letter 'M' as the root that holds all of the WORDS in the Declaration of Independence.
Handle collisions by considering the second, third, etc. duplicates to be greater than. (Note we will not be modifying this tree nor doing deletions!)
Programmatically answer the following questions:
What is the size (height and number of nodes) in your tree
Search for several worlds in your Linked List lab, Hash Table lab, and this lab and record the number of loops to fine the same words in each case.
Create a RED BLACK tree and follow the instructions from the BST lab.
Report the depth of the tree and the total number of words stored.
Now, find the words in the leaves of the tree, and search for those words and determine if the time to find those words is approximately “log(depth)” (Remember to count cycles not actual time. - We are determining the “Big O” of an ordinary binary tree, which we will compare to a Red-Black tree in the final project.
Display the results.
Add a paragraph on how you would have written the lab 6 code differently so that you could have reused the some of the code without modification. (ie. Code Reuse)
Handle ALL error conditions and unexpected errors using TRY/CATCH/FINALLY blocks.
1 Solution for 2 Parts: Part 1 is a BST and Part 2 is a Red Black tree using the BST