Question A binary tree can be implemented using arrays or linked lists. When an array is used, each element in the array stores a structure that has an information field and two pointer fields for left and right children. struct node int key stzuct node left: struct node *right ; Given the tree structure below 13 10 2 1 20 31 13 is the root and has children 10 and 25. The root of the tree is always in the first cell of the array. A value of -1 represents an empty cell. The above tree can thus be represented as in the table below: Right Info 13 31 25 12 10 Left 0 7 20