Manipulate an ordered binary tree
Date/Time of Processing: Tuesday 24 May 1994 01:35:21Pm Overall Assessment of System: OK Classification of System: B Basis of Classification -- Syntax Errors PASS Completeness PASS Independence from External Libraries FAIL Independence from a Specific Ada Compiler PASS Explanations for failures -- System withs non-standard library units that are not provided Number of ... Files 2 Library Units 2 Lines 365 Statements 71 Comments 151 Unidentified Withed Units -- 1 unidentified withed units
languages/ada/asr/new-abstractions/btrees: File Name Size --------- ---- btrees.zip 3,388 Totals ============== ============== 1 Files 3,388
This generic package creates an ordered binary tree. Quick insertion and search are supported by this data structure. The tree is organized such that leftchild < root < rightchild Subprograms provided are: Create Creates a tree Deposit Replaces the given node's information with the given information DestroyTree Destroys the given tree and returns the space InsertNode Inserts a node into a tree MakeTreeIter Return an iterator More, Next Iterator functions NEW_ABSTRACTIONS is used by NOSC/WIS tools 4.1.1 and 4.1.2.
DATE VERSION AUTHOR HISTORY 03/85 1.0 Bill Toscano Initial Release
This prologue must be included in all copies of this software. This software is copyright by the author. This software is released to the Ada community. This software is released to the Public Domain (note: software released to the Public Domain is not subject to copyright protection). Restrictions on use or distribution: NONE
This software and its documentation are provided "AS IS" and without any expressed or implied warranties whatsoever. No warranties as to performance, merchantability, or fitness for a particular purpose exist. The user is advised to test the software thoroughly before relying on it. The user must assume the entire risk and liability of using this software. In no event shall any person or organization of people be held responsible for any direct, indirect, consequential or inconsequential damages or lost profits.