#MyStrategyEvolution (c) Use the Binary Search Tree that results from inserting your C, H, A, R, L, E, S, B, A, B, B, A, G, E into an initially empty tree. Draw the intermediate trees, please circle the final tree. After constructing the final tree, delete the root node. Show each step. Then traverse the final tree in: Post-Order, Pre-Order and In-Order.

Insertion Steps (C, H, A, R, L, E, S, B, A, B, B, A, G, E):