Balanced Binary Tree - implementation in C
Be the first to post a text review of BaBiT. Rate and review a project by clicking thumbs up or thumbs down in the right column.
Version 1.7: Implementation of functions tsearch, tfind, tdelete, twalk, tdestroy in babsrch.h and babsrch.c. Test program bttest.c attached. This required some changes, which should be invisable for users: * BabitCmpFunEx and BabitFndFunEx correspond to BabitCmpFun and BabitFndFun, but they have an extra (user) parameter (type BABIT_EXTRAPAR). * BabitControlBlock has a new field (fndextra), which contains the value to pass to fndfun/cmpfun as third parameter. * New function BabitGetFather returns father/left child/right child of a tree-member. (I think it is meaningless but tdelete uses it.) New function BabitDestroy to destroy the whole tree. (Cannot destroy a part of a tree, only the whole!) Type BABIT_OFFSET is now ptrdiff_t by default (stddef.h is included by babit.h). New macros BabitPtrToOffs, BabitOffsToPtr in babit.h.
Be the first person to add a text review.
Copyright © 2009 Geeknet, Inc. All rights reserved. Terms of Use
Thanks for your rating!
Would you also like to write a review?