chap non-binary trees figure sample binary tree for sequential tree implementation examples example for the binary tree of figure the corresponding sequential representation would be as follows (assuming that '/stands for null)ab/ //ceg///fh// /( to reconstruct the tree structure from this node listwe begin by setting node to be the root ' left child will be node node ' left child is null pointerso node must be ' right child node has two null childrenso node must be the right child of node to illustrate the difficulty involved in using the sequential tree representation for processingconsider searching for the right child of the root node we must first move sequentially through the node list of the left subtree only at this point do we reach the value of the root' right child clearly the sequential representation is space efficientbut not time efficient for descending through the tree along some arbitrary path assume that each node value takes constant amount of space an example would be if the node value is positive integer and null is indicated by the value zero from the full binary tree theorem of section we know that the size of the node list will be about twice the number of nodes ( the overhead fraction is / the extra space is required by the null pointers we should be able to store the node list more compactly howeverany sequential implementation must recognize when leaf node has been reachedthat isa leaf node indicates the end of subtree one way to do this is to explicitly list with each node whether it is an internal node or leaf if node is an internal nodethen we know that its