6 When searching a table with length n by binary search, how many comparisons are needed in the worst case? (1.85) A nlogn B logn+1 logn D n O A . E60/3 4419 5 The binary sort tree (BST) is represented by left-right chain, then the node with the smallest keyword value (1.85) A may be root node B must be leaf node C its degree must be 1 D. None of the above is true B B 599/ 4428 T-M