This repository contains a generic, from-scratch implementation of a Binary Search Tree (BST) in modern C++. The primary goal of this project is to gain a deep, "under-the-hood" understanding of how ...

1). All nodes of left sub-trees are less than his root node. 2). All nodes of right sub-trees are greter than than his root node. 3). Left and Right sub-trees are also binary tree. it means sub-trees ...