Binary Trees
A binary tree is made of nodes, where each node contains a “left” pointer, a “right” pointer, and a data element. The “root” pointer points to the topmost node in the tree. The left and right...
Read MorePosted by M. Saqib | Updated Jul 16, 2009 | Data Structures |
A binary tree is made of nodes, where each node contains a “left” pointer, a “right” pointer, and a data element. The “root” pointer points to the topmost node in the tree. The left and right...
Read MorePosted by M. Saqib | Updated Apr 7, 2020 | Free Utilities |
This is implementation of Bayer-Trees, which are normally used for indices of data bases. These routines provide all stuff that is needed to create and destroy; insert, update and delete; load and destroy; search and traverse; check a tree. Sort huge amounts of data by doing a multi-phase sorting on temporary files.
Read MorePosted by M. Saqib | Sep 9, 2008 | C Programming Source Code |