Given the following Binary Search Tree, if 11 and 19 are removed, the preorder of the resultant tree will be: 13 10 31 A 4,5,6,8,10,17,31,43,49 B 6,4,5,8,10, 17,43,31,49 C 10,6,4,5,8,17,43,31,49 D) 10,6,4,5,8,43,31,49,17