www.delorie.com/gnu/docs/avl/libavl_42.html | search |
![]() Buy GNU books! | |
[ < ] | [ > ] | [ << ] | [ Up ] | [ >> ] | [Top] | [Contents] | [Index] | [ ? ] |
Searching a binary search tree works just the same way as it did before when we were doing it inside an array. We can implement bst_find() immediately:
See also: [ Knuth 1998b], section 6.2.2; [ Cormen 1990], section 13.2; [ Kernighan 1988], section 3.3; [ Bentley 2000], chapters 4 and 5, section 9.3, appendix 1; [ Sedgewick 1998], program 12.7.
webmaster | delorie software privacy |
Copyright © 2003 by The Free Software Foundation | Updated Jun 2003 |