If an item is to be inserted into the tree whose key data member is less than the key data member is node 1 but greater than the key data member in node 5, where would it be inserted? (b). If node 1 is to be deleted, the value in which nodes could be used to replaced it? (c). 4 2 7 5 1 6 8 3 is a traversal of the tree in which order? (d). 1 2457368 is a traversal of the tree in which order? Which tree traversal corresponds to a depth first graph traversal? Which tree traversal corresponds to a breadth first graph traversal? What auxiliary structure is used for a breadth-first traversal of a graph? What auxiliary structure is used for a depth-first traversal of a graph? What do binary search trees and heaps have in common? What makes them different