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 Traversals and Views.

This program represents the form of binary trees in linked lists, it allows in-order, pre-order and post-order traversals, as well as inserting new nodes, searching for keys, deleting nodes, among other functions.

Here are two samples of the tree structure and an ability to set traversing type in-depth or in-width