 A heap shares some of the ordering properties of a linked list, but is almost always implemented using an array.Instead of references from node to node, the next and previous data indexes are calculated using the current data's index.A self-organizing list rearranges its nodes based on some heuristic which reduces search times for data retrieval by keeping commonly accessed nodes at the head of the list.