35A complete binary tree is stored efficiently in an array because:AIt is always balanced by rotationBFor index i, children are at 2i + 1 and 2i + 2CIt has no leavesDAll nodes have one childView AnswerWorkspaceReportSaveEasy