We start with a Binary Search Tree where left child < parent < right child. This BST contains values: 1, 2, 3, 4, 5, 6, 7.