I made non recursive postorder using stack. But in Main function, rather than just typing all the TreeNodes by hand, I want to get TreeNodes using scanf. For example, printf("How many TreeNodes do you want?"); and get numbers of TreeNodes and then printf("enter TreeNodes"); so I enter 1 2 3 4 5 like this. How can I code it?
#include <stdio.h>
#include <stdbool.h>
#define STACK_SIZE 10
typedef struct TreeNode {
int data;
struct TreeNode* left;
struct TreeNode* right;
}TreeNode;
typedef struct Stack {
TreeNode *buf[STACK_SIZE];
int top;
}Stack;
void postOrder(TreeNode *root, Stack *stack)
{
Stack* s = stack;
if (root == NULL) return;
TreeNode* current = root;
TreeNode *tmp;
bool done = 0;
InitStack(s);
while(!done)
{
while (current != NULL)
{
if (current->right != NULL)
Push(s, current->right);
Push(s, current);
current = current->left;
}
if (IsEmpty(s))
break;
current = Pop(s);
if (IsEmpty(s))
{
printf("%d", current->data);
break;
}
tmp = Pop(s);
if (tmp == current->right)
{
Push(s, current);
current = current->right;
}
else
{
printf("%d", current->data);
Push(s, tmp);
current = NULL;
}
}
}
int main()
{
Stack s;
TreeNode one, two, three, four, five;
one.data = 1;
two.data = 2;
three.data = 3;
four.data = 4;
five.data = 5;
one.left = &two; one.right = &three;
two.left = &four; two.right = &five;
three.left = NULL; three.right = NULL;
four.left = NULL; four.right = NULL;
five.left = NULL; five.right = NULL;
postOrder(&one, &s);
printf("\n");
getchar();
return 0;
}
Implement a separate method to construct tree using dynamically memory allocation. Use malloc function to allocate memory. Insert the new node to tree at appropriate position.
void insertNode(TreeNode *root,int data){
//To Do create node dynamically using malloc and attach to root at appropriate position
}
Method to read input will look like below main function:
int main()
{
Stack s;
TreeNode *rootNode = NULL;
int nodeCount;
int data;
printf("Enter number of nodes:\n");
scanf("%d",&nodeCount);
printf("enter TreeNodes Data:\n");
for (int i=0; i < nodeCount; i++) {
scanf("%d",&data);
insertNode(rootNode,data);
}
postOrder(rootNode, &s);
return 0;
}
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.