Please explain, tks.

Question 10 1 pts Which of the following is true for a binary search trees? On each path from root to a leaf, there are same number of nodes. search generally takes O(log n) computing times O the value at every node is greater than that at its parent and less than those in its children insertions take O(n), worst case