Create a Binary Search Tree using the lists below: List 1: Leo, Hester, Ressie, Keira, Damian, Victor, Collin, Marci, Ashlie, Willis, Eric, Mya, Elizabeth, Ralph
a. List out the tree created by the add order of list 1 using post-order traversal.
b. If we removed the node containing Damian, what two values could we replace it with?
c. What if we removed the node containing Ressie?
List 2: Victor, Ralph, Leo, Mya, Eric, Elizabeth, Hester, Damian, Willis, Collin, Keira, Marci, Ashlie, Ressie
a. List out the tree created by the add order of list 2 using post-order traversal.
Compare the tree from list 1 with the tree from list 2, which do you think would perform better for the add and remove methods?