Often a binary tree is represented in a particular implicit data structure packed into an array whereby the left and right children of
t[x] are found at
t[2x+2]. This is commonly done in implementations of heaps, for example.
Does this representation have a canonical name? I am somewhat fed up of referring to it as “a representation of a tree in an array like in a heap”.