linked structure for general trees when representing binary tree with linked structureeach node explicitly maintains fields left and right as references to individual children for general treethere is no priori limit on the number of children that node may have natural way to realize general tree as linked structure is to have each node store single container of references to its children for examplea children field of node can be python list of references to the children of the node (if anysuch linked representation is schematically illustrated in figure new york parent element baltimore chicago providence children (aseattle (bfigure the linked structure for general tree(athe structure of node(ba larger portion of the data structure associated with node and its children table summarizes the performance of the implementation of general tree using linked structure the analysis is left as an exercise ( - )but we note thatby using collection to store the children of each position pwe can implement children(pby simply iterating that collection operation lenis empty rootparentis rootis leaf children(pdepth(pheight running time ( ( ( ( (ntable running times of the accessor methods of an -node general tree implemented with linked structure we let denote the number of children of position the space usage is (