Create a binary tree using the “adventure.txt” file. You must create new nodes and form the binary tree using a recursive function

INSTRUCTIONS TO CANDIDATES

ANSWER ALL QUESTIONS

Programming Assignment

1) Create a binary tree using the “adventure.txt” file. You must create new nodes and form the binary tree using a recursive function. The structure for each node should look like:

struct node

{

    char data[200];

    int choice;

    struct node *parent;

    struct node *left;

    struct node * right;

};

The way that the file is formatted is that the first sentence is the data for the root of the binary tree, the following sentence will be the data for the left child, then it will continue this pattern until you find a sentence that starts with “E”. When that is found then that will become the data for the left child external node. Then the next line will be the data for the right child of the current node. If you enumerate i.e. the first line is 1, the second is 2, etc. the lines in the file of “adventure.txt” the resulting binary tree will have this structure.

2) Make a function that will allow you to “play” through the adventure by making a choice at each internal node. (Hint: This means you will have to traverse the binary tree based on the input from the user)

3) Once an external node is reached print out the path that was taken to get there, i.e. print the data of the ancestor nodes of the external node.

 

Deliverables:

Upload your program onto blackboard as a “{first_name}_{last_name}_a5.c” file and make sure that it compiles using gcc. Be sure that your program follows the exact specifications, or you will lose points. Also, your code must be well commented with a comment at the beginning of your file that contains your name, ID number and the course (EE 2372). The format should look like this:

My Name

ID Number

EE 2372

Point Distribution:

Follows the naming specification/Good comments (5%)

Functionality/Following Program Specifications (45%)

Demo (50%)

Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of