Subject. Data structure

I need number 12 & 19 pls

The netrieval of an ih in a stack n wbich operation e Empty 10. Ie the linked list epresestation of the stack, which npecents the top of stack d. Header e. Nall poine 11. The inonder traversal of a tree will yielda sorted listing of elemests of which a Bisary tree. b. Heaps c Binary seanch tree. 12. Inthe antay implementation of.queuwhich firmala computes the ndex ofthe clement in the array to insent the new value? d (not-sun0 % data length e None of the above 13. In an inorder travernal ef a binary tree, the root sode is visited a. After the traversal of the right and left sobtees b. Befoee the traversal of the right and left subtrees e I-between the izaversal of the left and net d Before all other nodes in the tree e. nr ofthe above. a 14. Which of the following is an application of a stack? a. Infix to postfix b. Breadth first search c Print queue d Sorting e. None of the above 15. A binary search tree in which the nodes have been inserted in the following onder: 60, 55, 95, 40, 30, 100, 35, the node with the value 47 will be inseried to the a. Left child of the node with the value 95 b. Right child of the node with the value 55 c Right child of the node with the value 35 d Left child of the node with the value 30. e. Right child of the node with the value 40