in terms of space, complete binary tree is efficient

therefore option B and D are eliminated, but option A can't, due to it is also a type of complete binary tree

W.r.to Time complexity, AVL is better than Complete Binary tree

due to it is BST and operations like insertion, deletion and search can be performed in O(log N) time

Option A is right