rarm / trees

Implementation of General Binary Tree and Binary Search Tree data structures in C++. This implementation could be extended for other projects.

Trees

This repository contains an implementation of the general tree data model and the binary tree for educational purposes.

Implemented models:

• Binary tree.
  • Traversal operations:
    • In-order
    • Pre-order
    • Post-order
• Binary Search Tree (BST).
  • Operations:
    • Search
    • Insert
    • Delete

Implementation is in the trees.cpp and trees.hpp files. Demonstration is in the demo.cpp file.