[c] btree traversal

traverse.c

/* btree traversal - most left to most right */

pnode traverse(pnode root, void (*func)(pnode))                                                                                                                                             
{                                                                                                                                                                                          
     pnode ret, tmp = root;                                                                                                                                                                
     if(!root) return root;                                                                                                                                                              
     while((tmp = traverse(tmp->left, func))){; }                                                                                                                                          
     ret = traverse(root->right, func);                                                                                                                                                   
     func(root);    /* function to manipulate node */                                                                                                                                                                       
     return  ret;                                                                                                                                                                            
} 

/* minimal - do stuff in between recursive calls*/
pnode traverse(pnode root)
{
     if(!root) return root;                                                                                                                                                              
     traverse(root->right)
     traverse(root->left)                                                                                                                                            
     return  root;  
}