notes curr->right newprogrambinary tree creation array-based representation of binary tree consider complete binary tree having nodes where each node contains an item (valuelabel the nodes of the complete binary tree tht from top to bottom and from left to right - associate with the array where the entry of is the item in the node labelled of ti - figure depicts the array representation of binary tree of figure given the index of nodewe can easily and efficiently compute the index of its parent and left and right childrenindex of parent( )/ index of left child index of right child table array representation of binary tree item left child right child - - node - - - - - - - - first column represents index of nodesecond column consist of the item stored in the node and third and fourth columns indicate the positions of left and right children (- indicates that there is no child to that particular node binary tree traversal this section discusses different orders in which binary tree can be traversed the algorithms for some commonly used orders of traversal are also presented it also discusses the issue of construction of unique binary tree given the orders of traversal order of traversal of binary tree the following are the possible orders in which binary tree can be traversed ldr lrd dlr rdl rld drl lovely professional university