diff options
| author | cdgill <cdgill@ae88bc3d-4319-0410-8dbf-d08b4c9d3795> | 1998-05-11 18:23:27 +0000 |
|---|---|---|
| committer | cdgill <cdgill@ae88bc3d-4319-0410-8dbf-d08b4c9d3795> | 1998-05-11 18:23:27 +0000 |
| commit | 568fc541d4d160d059838b46f3c5403d502a8f3a (patch) | |
| tree | e4fe72778e951a5f264b54f0c6d1b2e6c14fc1c6 /ChangeLog-98b | |
| parent | 4f533c47e81735c8f04abf0de174692a62407c66 (diff) | |
| download | ATCD-568fc541d4d160d059838b46f3c5403d502a8f3a.tar.gz | |
first revision of Red-Black Tree data structure implementation
Diffstat (limited to 'ChangeLog-98b')
| -rw-r--r-- | ChangeLog-98b | 12 |
1 files changed, 12 insertions, 0 deletions
diff --git a/ChangeLog-98b b/ChangeLog-98b index 05b6da28c20..6aee4a75135 100644 --- a/ChangeLog-98b +++ b/ChangeLog-98b @@ -1,3 +1,15 @@ +Mon May 11 13:14:22 1998 Chris Gill <cdgill@cs.wustl.edu> + + * ace/RB_Tree.{cpp,h,i}: (new) Red-Black Tree data structure + implementation. A Red-Black Tree is an efficient + self-balancing binary tree that uses recoloring to + minimize rotations while rebalancing on insertion or + deletion of a tree node. Items in the tree are stored + according to a key provided at insertion. This + implementation is an OO rendition of the ADT described + in Cormen, Leiserson, Rivest, "Introduction to Algorithms" + (c) 1990, MIT. + Mon May 11 12:31:41 1998 Steve Huston <shuston@riverace.com> * ace/OS.h: Made ACE_LD_SEARCH_PATH, ACE_LD_SEARCH_PATH_SEPARATOR_STR, |