SCHOOL OF CODE BUILDERS: Level order traversal in spiral form

Level order traversal in spiral form

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

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

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

struct node* insert(struct node *root,int data)
{
 if(root==NULL)
  return newnode(data);
 if(data < root->data)
  root->left=insert(root->left,data);
 else
  root->right=insert(root->right,data);
 return root;
}

void inorder(struct node *root)
{
 if(root==NULL)
  return;
 inorder(root->left);
 printf("%d ",root->data);
 inorder(root->right);
}

int findmax(int x,int y)
{
 return x>y?x:y;
}

int finddepth(struct node *root)
{
 if(root==NULL)
  return 0;
 int ldepth=finddepth(root->left);
 int rdepth=finddepth(root->right);
 return 1+findmax(ldepth,rdepth);
}

void printlevel(struct node *root,int level,int flip)
{
 if(root==NULL)
  return;
 if(level==0)
  printf("%d ",root->data);
 if(flip)
 {
  printlevel(root->left,level-1,flip);
  printlevel(root->right,level-1,flip);
 }
 else
 {
  printlevel(root->right,level-1,flip);
  printlevel(root->left,level-1,flip);
 }
}

void levelinspiral(struct node *root)
{
 int depth=finddepth(root);
 //printf("depth is %d",depth);
 int level;
 int flip=1;
 for(level=0;level<depth;level++)
 {
  printlevel(root,level,flip);
  printf("\n");
  flip=!(flip);
 }
}

int main(void) {
 struct node *root=NULL;
 root=insert(root,5);
 insert(root,3);
 insert(root,7);
 insert(root,4);
 insert(root,2);
 insert(root,1);
 insert(root,6);
 insert(root,8);
 //inorder(root);
 levelinspiral(root);
 return 0;
}

Pages

Level order traversal in spiral form