binary sorting
void printInOrder(noBinTree *n){ if(n != NULL){ printInOrder(n->right); printf(" %d ", n->number); printInOrder(n->left); } }
Source: duckduckgo.com
void printInOrder(noBinTree *n){ if(n != NULL){ printInOrder(n->right); printf(" %d ", n->number); printInOrder(n->left); } }