 No space is required for pointers; instead, the parent and children of each node can be found by arithmetic on array indices.These properties make this heap implementation a simple example of an implicit data structure or Ahnentafel list.Details depend on the root position, which in turn may depend on constraints of a programming language used for implementation, or programmer preference.