This pull request refactors the existing 'BinaryTree' to 'BinarySearchTree' in the C++ codebase. The key changes are as follows:
Renamed 'BinaryTree' to 'BinarySearchTree' to emphasize its Binary Search Tree behavior, enforcing properties that ensure each node is greater than nodes in its left subtree and less than nodes in its right subtree.
Updated the README to reflect these changes.
Extended the 'BinarySearchTree' to include operations like 'delete', 'find min', and 'find max'. The code is now object-oriented, with 'BinarySearchTree' implemented as a class.
This pull request refactors the existing 'BinaryTree' to 'BinarySearchTree' in the C++ codebase. The key changes are as follows: