/Binary-Search-Tree--Simple-Travesals--and-Recursion

In this implementation of BSTs, One will be a standard BST where the left child has a smaller value than the right child. The other will be a mirrored BST where the right child has a smaller value than the left child.

Primary LanguageJavaApache License 2.0Apache-2.0

Stargazers