other strictly binary treean almost complete binary tree with leaves that is not strictly binary has nodes there are two distinct almost complete binary trees with leavesone of which is strictly binary and one of which is not there is only single almost complete binary tree with nodes this tree is strictly binary if and only if is odd representing binary trees in memory array representation for complete or almost complete binary treestoring the binary tree as an array may be good choice one way to do this is to store the root of the tree in the first element of the array thenfor each node in the tree that is stored at subscript kthe node' left child can be stored at subscript + and the right child can be stored at subscript + for examplethe almost complete binary tree shown in diagram can be stored in an array like sohoweverif this scheme is used to store binary tree that is not complete or almost completewe can end up with great deal of wasted space in the array