10. Which of the following statements are true? A. Finding an arbitrary element in a binary search tree has ?(log n) worst case time complexity. B. Traversing a binary tree can be done in linear time in terms of the number of nodes C. An in-order traversal of a binary search tree produces sorted output. D. Deletion of an element from a binary tree has O(n) worst case time complexity E. None of the above statements are true