What are advantage(s) of a heap for storing a priority queue, compared to an AVL tree?

  • A: faster Big O
  • B: simpler code
  • C: uses less memory
  • D: A and B
  • E: B and C

    Answer

    Contents    Page-10    Prev    Next    Page+10    Index