Create a tree node and add to the tree as you read input from the file. Travers the binary tree in pre-order, post-order and in-order both recursive and non-recursive implementations

Travers the binary tree in pre-order, post-order and in-order both recursive and non-recursive implementations

I have three exercise assignments in c language.  I shared the explanation of the instructor and the all information of the exercises as pdf and ptt.

1.

Link List

Follow the instructions in the assignment.

This assignment deals with linear linked list. Read the input from the input file, do not initialize an array with input numbers. Create and add the link to the list as you read the input. Give the output after each task with a header explaining the task. Prompt the user for deleting the entries from the list and output after each deletion. Follow te order in which the deletion to be processed as given in the assignment. Please do not intialize an array for deleting the entries.

 

2.

Binary trees

Follow the instructions in the assignment.

This assignment deals with binary tree implementation. Read the input values from the input file and implement a binary tree. Create a tree node and add to the tree as you read input from the file. Travers the binary tree in pre-order, post-order and in-order both recursive and non-recursive implementations.  Print output after each traversals, prompt the user to delete an element until the user quits. Please do not create an array to delete tree nodes. Print the binary tree output after every deletion. Delete items are given in the assignment .pdf file. Iterative algorithm output and hints are given in the Additional Reading Material.

Hint: non-recursive implementations need the use of stack. As you visit the node, you need to stack the node in the required order for traversal.

Implement both recursive and non-recursive methods.

3.

Hashing

Follow the instructions in the assignment.

This assignment involves in implementing hashing and hash table and gives you average full credit.
Create and add a link node to the hash table as you read the input from file.

find the cost of your paper