Create binary search tree and out the following array for ("apple, "banana", "cherry", "date" grape, "mango" Create min heap tree for (7, 3, 5, 2, 4, 6) When the root is removed from the above heap tree, how do we alter the tree? Create a new heap tree step by step. Find the following orderings for traversals