Description
Implement Tree Traversal (Inorder, Preorder, Postorder). Your Tree ADT has twelve nodes. You should implement three functions for printing the tree traversal results.
- Inorder print the tree traversal result using inorder traversal.
- Preorder print the tree traversal result using preorder traversal.
- Postorder print the tree traversal result using postorder traversal.
A tree is shown below.
|
|
- Tree ADT
(1) Data Specification for the objects
Typedef struct Tree_node {
int key;
struct Tree_node *left;
struct Tree_node *right;
}Tree_node;
(2) Function specification
-
Tree_node* CreateNode(int key)
-
void Preorder(Tree_node* node)
-
void Inorder(Tree_node* node)
-
void Postorder(Tree_node* node)
2. Program description
-
name : p5.c
-
output : the corresponding result in the standard output
Submit to the course gitlab your source code. (~2020/4/23 23:59)
