1)

2)

3)

4)

The breadth first traversal starting from 1 for the given graph is ... 2 6 8 5 3 A 1,2,4,5,3,6 1,5,4,2,3,6 1,2,4,5,6,3 0 1,2,4,3,5,6 Given the following Binary Search Tree, fill in blank (write in digit form, for example, 6) The height of the tree isBlank 1 and number of leaves is Blank 2 Blank 1 Add your answer Blank 2 Add your answer Given the following Binary Search Tree, if 11 and 19 are removed the preorder of the resultant tree will be: ... 4,5,6,8,10,17,31,43,49 B 10,6,4,5,8,43,31,49,17 10,6,4,5,8,17,43,31,49 0 6,4,5,8,10, 17,43,31,49 The depth first traversal starting from 4 for the given graph is A 4,1,2,5,3,6 B 4.1,2,3,5,6 4,5,2,5,6,1 D 4,3,2,1,5,6