Skip to content
Open
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
147 changes: 147 additions & 0 deletions C/Language/iterativeinordertraversal.c
Original file line number Diff line number Diff line change
@@ -0,0 +1,147 @@
#include<stdio.h>
#include<stdlib.h>
#define bool int


struct tNode
{
int data;
struct tNode* left;
struct tNode* right;
};


struct sNode
{
struct tNode *t;
struct sNode *next;
};


void push(struct sNode** top_ref, struct tNode *t);
struct tNode *pop(struct sNode** top_ref);
bool isEmpty(struct sNode *top);


void inOrder(struct tNode *root)
{

struct tNode *current = root;
struct sNode *s = NULL;
bool done = 0;

while (!done)
{

if(current != NULL)
{

push(&s, current);
current = current->left;
}


else
{
if (!isEmpty(s))
{
current = pop(&s);
printf("%d ", current->data);


current = current->right;
}
else
done = 1;
}
}
}


void push(struct sNode** top_ref, struct tNode *t)
{

struct sNode* new_tNode =
(struct sNode*) malloc(sizeof(struct sNode));

if(new_tNode == NULL)
{
printf("Stack Overflow \n");
getchar();
exit(0);
}


new_tNode->t = t;


new_tNode->next = (*top_ref);


(*top_ref) = new_tNode;
}


bool isEmpty(struct sNode *top)
{
return (top == NULL)? 1 : 0;
}

/* Function to pop an item from stack*/
struct tNode *pop(struct sNode** top_ref)
{
struct tNode *res;
struct sNode *top;


if(isEmpty(*top_ref))
{
printf("Stack Underflow \n");
getchar();
exit(0);
}
else
{
top = *top_ref;
res = top->t;
*top_ref = top->next;
free(top);
return res;
}
}


struct tNode* newtNode(int data)
{
struct tNode* tNode = (struct tNode*)
malloc(sizeof(struct tNode));
tNode->data = data;
tNode->left = NULL;
tNode->right = NULL;

return(tNode);
}

/* Driver program to test above functions*/
int main()
{

/* Constructed binary tree is
1
/ \
2 3
/ \
4 5
*/
struct tNode *root = newtNode(1);
root->left = newtNode(2);
root->right = newtNode(3);
root->left->left = newtNode(4);
root->left->right = newtNode(5);

inOrder(root);

getchar();
return 0;
}