sec general tree implementations index val par figure the "list of childrenimplementation for general trees the column of numbers to the left of the node array labels the array indices the column labeled "valstores node values the column labeled "parstores pointers to the parents for claritythese pointers are shown as array indices the last column stores pointers to the linked list of children for each internal node each element on the linked list stores pointer to one of the node' children (shown as the array index of the target nodelist of children our first attempt to create general tree implementation is called the "list of childrenimplementation for general trees it simply stores with each internal node linked list of its childrenin order from left to right this is illustrated by figure the "list of childrenimplementation stores the tree nodes in an array each node contains valuea pointer to its parentand pointer to linked list of the node' childrenstored from left to right each list element contains pointer to one child thusthe leftmost child of node can be found directly because it is the first element in the linked list howeverto find the right sibling for node is more difficult consider the case of node and its parent to find ' right siblingwe must move down the child list of until the linked list element storing the pointer to has been found going one step further takes us to the linked list element that stores pointer to ' right sibling thusin the worst caseto find ' right sibling requires that all children of ' parent be searched combining trees using this representation is difficult if each tree is stored in separate node array if the nodes of both trees are stored in single node arraythen