Recent content by abramhum.c.l

this a a page which I found in web can run well. http://www.thelearningpoint.net/computer-science/trees/binary-search-trees---c-program-source-code-and-documentation And after do some debug, I still have the same problem, thanks a lot.

I still feel confused about delete F. I think it is somehow the process like link list, but seems something different. In link-list, if I hope to delete a node, like B in this case: A->B->C, if the structure is following: struct list_node { void* data; struct bst_node* right...

Hi: DH, if I hope to delete the point F, based on the codes, it should perform the following section: void delete(struct bst_node** node) { struct bst_node* old_node = *node; ... if ((*node)->right == NULL) { *node = (*node)->left; free_node(old_node); }...

I found the data from http://en.literateprograms.org/Binary_search_tree_(C)) In fact, there are many resources and data showing similar algorithm. Thanks.

Not exactly, this is a part of BST, and its purpose is to delete the node that user designated. The problem make me feel puzzled is the process of recursive. for example, if these exist four nodes like A, B,C, D; A is the parents of B, and C is the right child of B, and then D is the...

Hi: I was in a maze about delete in binary search tree. The followings is its codes: void delete(struct bst_node** node) { struct bst_node* old_node = *node; if ((*node)->left == NULL) { *node = (*node)->right; free_node(old_node); } else if ((*node)->right...