CSI HW4 Insert the following numbers into a Binary Search Tree, Red-Black Tree and an AVL Tree. 100 200 110 190 120 180 130 170 140 160 150 Insert the numbers in this order. For example, insert 100 first. Then insert 200. The height of a tree describes the worst case for how many nodes must be searched before a node is proven to be in (or out of) the tree. What are the heights of each of these trees? Which has the best balance (the tree smallest height)? Opinion: Which was easier to accomplish by hand?