Binary Trees
A binary tree is made of nodes, where each node contains a “left” pointer, a...
Read MorePosted by M. Saqib | Jul 18, 2009 | Data Structures: Different Articles on Data Structures |
A binary tree is made of nodes, where each node contains a “left” pointer, a...
Read MorePosted by M. Saqib | Sep 19, 2008 | Utility Programs and Applications |
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 | Java: Java Programming Concepts |
Posted by M. Saqib | Sep 9, 2008 | C Programming Source Code |
This is a C Program to implement tree data structure. It uses current working directory as the root and traverse all files inside the directory and prints them on the screen. You can use any C/C++ compilers to compile and run this program however, it is tested using Turbo C++ Compiler only.
Read More