Data Structure C++ implementation

Table of Contents

Implemented Data Structures

• Linked List: Includes functions for insertion, deletion, and traversal.
• Stack: Provides standard stack operations such as push, pop, and peek.
• Queue: A simple implementation of the queue data structure.
• Binary Search Tree (BST): Features insertion, search, and traversal operations.
• Heap Sort: Contains the implementation of the heap sort algorithm.
• Tree Traversals: Demonstrates pre-order, in-order, and post-order traversals.

Features

• Educational Resource: Clear, modular implementations that serve as both a learning tool and a reference.
• Modular Code Organisation: Each data structure is implemented separately to ease navigation and reuse.
• CMake Support: Comes with a CMakeLists.txt file to streamline the build process.
• Lightweight: Minimal dependencies ensure easy compilation and portability.

Prerequisites

• A C++ compiler that supports C++14 (or later).