Heaps

Question

Consider the following statements

I: The depths of any two leaves in a max heap differ by at most 1.
II: Inserting an element into a binary search tree of size n always takes O(log n) time.
Which of the above statements is/are true ?

Answer 1

first statement is true.. as heap fill it level by level.. also said to be complete binary tree..
for the second statement,  as binary search tree either can be left skewed or right skewed in worst case.. so in that case insertion will take O (n).. so this statement is false...