mmandusic / 2-3-4-tree

Implementation of the 2-3-4 Tree (B-tree of order 4)

2-3-4-Tree

IMPORTANT: Any student submitting the codes as their own is an act of plaigarism and is a violation of Washington State University's "Student Honor's Code". The intention of me posting my programs is for collaboration and to hear feedbacks on possible improvements on the coding. This code repository also serves as my code portfolio and its purpose is for future employers to examine my coding skills. Please reference if you use part of the code and DO NOT PLAGIARIZE. "Academic Dishonesty" falls under the Standards of Conduct for Students.

According to Wikipedia, 2-3-4 trees are self-balancing data structure that is commonly used to implement dictionaries. 2-3-4 trees are B-trees of order 4.

For more information, visit http://en.wikipedia.org/wiki/2–3–4_tree.

The Code

This is probably one of the most difficult algorithm I had to implement. We are given a header file template to work with and we are tasked to implement the following functions:

• bool Add(T& toCopyAndAdd)
• T* Find(int key)
• bool Remove(int key)

Future Improvements

• The goal was to implement the 2-3-4 algorithm, but I have plans to dig deeper with my implementation and make some changes to ensure efficient implementation.
• Use the algorithm for real world applications
• Find ways to improve it