Mantis Binary Tree

This project contains a simple and efficient implementation of a binary tree in PHP. A binary tree is a hierarchical data structure in which each node has at most two children, often referred to as the left and right child. Binary trees are useful for various applications, such as searching, sorting, and organizing data.

Features

• Easy-to-use interface for creating and manipulating binary trees
• Basic tree traversal algorithms
• Insertion and search operations
• Node removal
• Counting the number of nodes in the tree

Source Code

Source code is available at https://gitlab.com/mantisbt/mantisbt

Installation

To install the Mantis Binary Tree Library, simply grab it from packagist.org using composer:

composer require mantisbt/mantisbt