Tag: B-Tree

Binary Trees

Posted by M. Saqib | Updated Jun 27, 2021 | Data Structures |

A binary tree is made of nodes, where each node contains a “left” pointer, a...

Bayer-Trees implementation in C

Posted 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.

Process Binary Trees – Java

Posted by M. Saqib | Sep 9, 2008 | Java |

This program demonstrates a few routines for processing binary sort trees. It uses a binary sort tree of strings. The user types in strings. The user’s string is converted to lower case, and — if it is not already in...

Tree manipulation and traversing

Posted by M. Saqib | Sep 9, 2008 | C Programming Source Code |

Nice tree manipulation and traversing/******************************************************* * MYCPLUS Sample Code – https://www.mycplus.com * * * * This code is made available as a service to our * * visitors and is...