fill in the blanks complexity: A. The complexity of inserting a node in a binary search tree (BST) of N nodes is ________

B. The complexity of insert in a Min heap of N nodes is ____O(log n)____

C. The complexity of finding the minimum element in a Min heap of N nodes is ________

D. The complexity of finding the minimum element in a BST of N nodes is ________

E. The complexity of finding the minimum element in a Binary tree of N nodes is ________

F. The complexity of search in a Btree of N nodes is ________

G. The complexity of search in a AVL tree of N nodes is ________

H. The complexity of insert in a AVL tree of N nodes is ________

please help me on data structure and algorthm