replace ( rootparentchildrenleftrightsibling ( haslefthasrightisinternalisexternalisroot ( insertleftinsertrightattachremove ( an array-list representation of binary tree an alternative representation of binary tree is based on way of numbering the nodes of for every node of tlet (vbe the integer defined as follows if is the root of tthen ( if is the left child of node uthen ( (uif is the right child of node uthen ( ( the numbering function is known as level numbering of the nodes in binary tree tfor it numbers the nodes on each level of in increasing order from left to rightalthough it may skip some numbers (see figure figure binary tree level numbering(ageneral scheme(ban example