Home/ Questions/Q 7768583
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Asked: 2026-06-01T15:57:02+00:00

Is there any speed/space/general performance gains in using array based implementation of a binary

  • 0

Is there any speed/space/general performance gains in using array based implementation of a binary tree rather than the old node-based implementation? I understand rotations or any other complex modifications of an array based tree would be horrific but in the case of a simple binary tree implementation would you say one would be better off doing it via arrays?

Share

Leave an answer

You must login to add an answer.

Need An Account,

1 Answer

  1. Editorial Team

    I guess that you are looking for a Binary Heap.

    • 0