-
Notifications
You must be signed in to change notification settings - Fork 0
Interval Tree And Red Black Tree
License
S-John-S/CSN-212_Tutorial-3
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
15114060 S John S CSN-212 Tutorial 3 This directory contains source code for data structures which implement balanced binary trees (red-black trees) and interval trees. The main source code files are: RedBlackTree.h, RedBlackTree.cc interval_tree.cc, interval_tree.h These files depend on: misc.h (miscellaneous stuff like safe version of malloc + assert macro) TemplateStack.H (array based stacks via templates) The other files are used to run regression tests. gmake test runs all the current regression tests and reports the results. The minimum functions are listed as follows in the header files:- Interval * DeleteNode(IntervalTreeNode *); IntervalTreeNode * Insert(Interval *); /*IntervalTreeNode * Search(Interval *);*/ /*this function is executed in the enumeration as multiple outputs of*/ /*overlaps in the function parameters*/
About
Interval Tree And Red Black Tree
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published