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.
java makefile recursion binary-tree breadth-first-search depth-first-search tree-traversal-algorithms mirrored-binary-tree
-
Updated
Oct 12, 2024 - Java