Binary Search Tree Discussion

Give one or more examples of GOOD (i.e., nearly balanced) BST’s.

Give one or more examples of BAD BST’s.

For example, {1, 2, 3, 4, 5, 6, 7} would be an example of a bad BST, while {4, 2, 6, 1, 3, 5, 7} would be a good BST.

As you present your BAD and GOOD BSTs, also discuss their corresponding Big O.