i needed some help with this program
Assignment (Click to show)
This is what i have so far Warning: Spoiler! (Click to show)
any help would be appreciated
Assignment (Click to show)
Quote:
Problem Statement
Data Structures – write a C program that creates, manages and traverses a binary tree. The tree is not required to be balanced. As
the interface is alphanumeric use the following:
n – create a new binary tree (if one already exists, make sure the user means this)
a – add a node to the tree
r – remove a node
t – traverse the tree
1 – pre-order
2 – in-order
3 – post-order
Sample Session
Commands for managing a binary tree
n – create a new binary tree
a – add a node to the tree
r – remove a node
t – traverse the tree
1 – pre-order
2 – in-order
3 – post-order
q - quit
Enter: n
Enter: a
Value to add: 17
17 added
Enter: a
Value to add: 10
10 added
Enter: a
Value to add: 30
30 added
Enter: a
Value to add: 12
12 added
Enter: t
Pick type of traverse: 1
17 10 12 30
Enter: t
Pick type of traverse: 3
12 10 30 17
Enter: q
Data Structures – write a C program that creates, manages and traverses a binary tree. The tree is not required to be balanced. As
the interface is alphanumeric use the following:
n – create a new binary tree (if one already exists, make sure the user means this)
a – add a node to the tree
r – remove a node
t – traverse the tree
1 – pre-order
2 – in-order
3 – post-order
Sample Session
Commands for managing a binary tree
n – create a new binary tree
a – add a node to the tree
r – remove a node
t – traverse the tree
1 – pre-order
2 – in-order
3 – post-order
q - quit
Enter: n
Enter: a
Value to add: 17
17 added
Enter: a
Value to add: 10
10 added
Enter: a
Value to add: 30
30 added
Enter: a
Value to add: 12
12 added
Enter: t
Pick type of traverse: 1
17 10 12 30
Enter: t
Pick type of traverse: 3
12 10 30 17
Enter: q
This is what i have so far Warning: Spoiler! (Click to show)
Code:
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
//self-referential structure
struct treeNode {
struct treeNode *leftPtr; //points to left sub tree
int d;
struct treeNode *rightPtr; //points to right sub tree
};
typedef struct treeNode TreeNode;
typedef TreeNode *TreeNodePtr;
void insertNode(TreeNodePtr *treePtr, int value);
void inOrder(TreeNodePtr treePtr);
void preOrder(TreeNodePtr treePtr);
void postOrder(TreeNodePtr treePtr);
int main(void)
{
unsigned int i;//counter for the loop
int item; //variable to hold the random numbers
TreeNodePtr reetPtr = NULL;//The tree is empty to start
srand( time (NULL));
puts("Commands for managing a binary tree");
puts("N - create a new binary tree");
puts("A - add a node to the tree");
puts("R - remove a node");
puts("T - travers a tree");
puts(" 1 - pre-order");
puts(" 2 - in-order");
puts(" 3 - post-order");
puts("Q - quit");
puts("enter:");
}
Switch 1090T
(20 items) |
Dream Rig Contest
(11 items) |
|
Switch 1090T
(20 items) |
Dream Rig Contest
(11 items) |
+rep
