pre_order_iteration.c

#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdbool.h>

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

struct node* get_newnode(int data){
	struct node* newnode=(struct node*)malloc(sizeof(struct node));
	newnode->data=data;
	newnode->right=newnode->left=NULL;
	return newnode;
}

struct node* insert(struct node* root, int data){
	if (root==NULL)
	{
		root=get_newnode(data);
	}
	else if(root->data>=data){
		root->left=insert(root->left,data);
	}
	else {
		root->right = insert(root->right,data);
	}
	return root;
}
int max(int a,int b){
	if (a>b)
	{
		return a;
	}
	return b;
}  
struct stack{
        int top;
        struct  node* items[101];
};

void push(struct stack* ms, struct node* item){
	ms->items[++ms->top]=item;
}
struct node* pop(struct stack* ms){
	if (ms->top>-1)
	{
		return ms->items[(ms->top)--];
	}
}
struct node* peek(struct stack ms){
	if(ms.top < 0){
      //printf("Stack empty\n");
      return 0;
   }
   return ms.items[ms.top];
}
int isempty(struct stack ms){
	if (ms.top<0)
	{
		return 1;
	}
	return 0;
}

void pre_order(struct node* root){
	struct stack ms;
	ms.top=-1;
	struct node* temp=root;
	if (root==NULL)
	{
		return;
	}
	push(&ms,root);
	//printf("hii\n");
	while(!isempty(ms)){
		temp=pop(&ms);
		//printf("hee\n");
		printf("%d ",temp->data );
		if (temp->right)
		{
			push(&ms,temp->right);
		}
		if (temp->left)
		{
			push(&ms,temp->left);
		}
	}
}


int main(int argc, char const *argv[])
{
	struct node* root=(struct node*)malloc(sizeof(struct node));
	root=NULL;
	root=insert(root,50);	
	root=insert(root,49);
	root=insert(root,25);
	root=insert(root,20);
	root=insert(root,3);
	root=insert(root,99);
	//int h=find_height(root);
	//printf("%d\n",h );
	pre_order(root);
	//puts("");
	return 0;
}