void delete_nodes_recur(bst_node *root) { if(root) { delete_nodes_recur(root->left); if(root) free(root); delete_nodes_recur(root->right); } }
static void bst_free_node(void *p) { bst_head *headNode = (bst_head *)p; delete_nodes_recur(headNode->head); }
static void bst_free_node(void *ptr) { if (ptr) { bst_head *headNode = ptr; delete_nodes_recur(headNode->head); } }