Although by definition of AVL tree(or height balance tree) right ans is B .But i think same property also holds for complete binary tree
as from a full binary tree if we start removing elements from the right most child we will always get a tree which is height balanced
any expert comments if i am wrong