https://github.com/tebogoyungmercykay/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.

binary-tree breadth-first-search depth-first-search java makefile mirrored-binary-tree recursion tree-traversal-algorithms

Last synced: 13 Apr 2025