Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/olubodemichael/project-5

C++ implementation of a binary search tree (BST) where nodes have at most two children ("left" and "right"). The left child contains values smaller than the node, and the right child contains values greater. Enables efficient search, insertion, and deletion of elements.
https://github.com/olubodemichael/project-5

Last synced: 1 day ago
JSON representation

C++ implementation of a binary search tree (BST) where nodes have at most two children ("left" and "right"). The left child contains values smaller than the node, and the right child contains values greater. Enables efficient search, insertion, and deletion of elements.

Awesome Lists containing this project

README

        

# Project-5
C++ implementation of a binary search tree (BST) where nodes have at most two children ("left" and "right"). The left child contains values smaller than the node, and the right child contains values greater. Enables efficient search, insertion, and deletion of elements.