. which is true about binary search trees? a. they cannot support logarithmic insertions b. they can support logarithmic searches c. they don't work well for sorted collections d. each node in the right subtree of a given node is less than that node