about 3 @ 10 pts each Data Structure 'Diagrams'- Adding to an empty Data Structure: For the Data Structures listed above (Stack/Queue/Binary Search Tree), show what the data structure will look like after a series of values are 'added' to the structure Examples: Suppose these are added in this order: Mango, Grape, Raisin, Apple, Plum, Lemon, Watermelon shon Show a Stack, Queue, Binary Search Tree after these 'adds' take place- indicate access points (top/front/rear/root)