Troy University Binary Tree Programming Project

Programming Challenge

Write two separate programs (completed code) for the following questions

1. Implement a Binary Tree via a Linked List

o After constructing a binary tree, use Preorder traversal to display the nodes in the tree

2. Iteratively insert a node in Binary Tree (NOT recursively)

o Use Inorder traversal to display the nodes in the tree

The followings are the requirements for this homework:

• You can either write separate programming for each or build a complex program to implement all the functions requested by every question
• You have to make sure your code works before submitting your homework. If you cannot make your code work, please write a short description of the problem you had, I would like to read or fix your code to give you partial credits.
• The screenshot(s) of the program’s output is also required to be submitted along with your source code
• You should find the example code from the lecture slides, directly coping from online code will result in a grade “0” for HW4, or even an “F” at the end of the Fall semester. Your submission will be checked by the plagiarism checking system