(athe position object associated with node(bthe 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 node vwe can implement children(vsimply by returning reference to this collection table running times of the methods of an nnode general tree implemented with linked structure we let denote the number of children of node the space usage is (noperation time sizeisempty ( iteratorpositions (