I will keep reposting this for 350 points! I need as much of the code as possibl
ID: 3621753 • Letter: I
Question
I will keep reposting this for 350 points! I need as much of the code as possibleObjective:
Write a C program that takes as input a list of integers (in random order), stores the integers in a binary tree, and uses a recursive algorithm to search the tree for a particular value.
Background:
Although binary trees can be represented with arrays, we would still have to deal with some memory issues ( ie: we might need enough contiguous memory for an extremely large tree, what if the tree is dynamic? what if some nodes only have 1 child?).
A more efficient way of handling binary trees could be with the use of dynamically allocated structures for the nodes, which are linked together with pointers. For example, we could have the following:
typedef struct node Node;
typedef Node* NodePtr;
typedef Node* Tree;
struct node
{
int value;
NodePtr Left;
NodePtr Right;
};
The above structure also works nicely for recursive functions, especially when adding data to a tree, searching for data in a tree, and (most important) freeing a tree.
Specifications: PLEASE USE THE SAME FUNCTION NAMES AS BELOW TO SAVE ME CONFUSION :)
1. The program will read data from an input file "Data.txt" and store the data in a tree. (Note: Build a complete tree.)
2. The program will prompt the user for a value to search for in the tree.
3. The program will use a pre-order traversal to search for the given value. (Which sort function is best for a tree?)
4. If the value is found, the program will announce that to the user and will tell the user the value of the left and right child of the given number. If the value is not found, program will politely report the situation.
5. The program will have an abstract data type (ADT) for the tree, and will include (as a minimum) the following functions for the ADT:
a. void InsertInTree(int value, Tree T)
b. NodePtr SearchTree(int value, Tree T)
c. void DeleteTree(Tree T)
7. The program will follow good programming practices.
a. It will check for failures opening the files and will provide a graceful exit if a failure exists.
b. The program will have appropriate programmer-defined functions so that the main function
provides a highlight of the program.