preorder(), inorder() and postorder().txt

It is an ebook about trees

Write C code to implement the preorder(), inorder() and postorder() traversals. Whats their time complexities? 

Discuss it!          


Preorder 


preorder(mynode *root) 
{ 
  if(root) 
  { 
    printf("Value : [%d]", root->value); 
    preorder(root->left); 
    preorder(root->right); 
  } 
} 


Postorder 

postorder(mynode *root) 
{ 
  if(root) 
  { 
    postorder(root->left); 
    postorder(root->right); 
    printf("Value : [%d]", root->value); 
  } 
} 




Inorder 

inorder(mynode *root) 
{ 
  if(root) 
  { 
    inorder(root->left); 
    printf("Value : [%d]", root->value); 
    inorder(root->right); 
  } 
} 



Time complexity of traversals is O(n).