Question:Which feature of heaps allows them to be efficiently implemented using a partially filled array? 

A Heaps are binary search trees 
B Heaps are complete binary trees 
C Heaps are full binary trees 
D Heaps contain only integer data 

+ Answer
B 

+ Report

Md. Habib Ullah

Editor, VCampus

Your Name

Your Email

Type of Report
Spelling MistakeIncorrect AnswerGrammar MistakeContent MissingImproper Text FormatInsufficient AnswerDuplicate QuestionImproper Sentence StructureImproper Equation/FormulaOther

Description