A utility function to do inorder traversal of BST
void inorder ( struct node * root , int s ) { if ( root != NULL ) { inorder ( root -> left , s ) ; if ( root -> c > ( s / 2 ) ) printf ( " % d ▁ STRNEWLINE " , root -> key ) ; inorder ( root -> right , s ) ; } }