sec sequential tree implementations two children (which may be subtreesimmediately follow in the node list if is leaf nodethen the next node in the list is the right child of some ancestor of xnot the right child of in particularthe next node will be the child of ' most recent ancestor that has not yet seen its right child howeverthis assumes that each internal node does in fact have two childrenin other wordsthat the tree is full empty children must be indicated in the node list explicitly assume that internal nodes are marked with prime ( and that leaf nodes show no mark empty children of internal nodes are indicated by '/'but the (emptychildren of leaf nodes are not represented at all note that full binary tree stores no null values with this implementationand so requires less overhead example we can represent the tree of figure as followsa /dc / hi ( note that slashes are needed for the empty children because this is not full binary tree storing bits can be considerable savings over storing null values in example each node is shown with mark if it is internalor no mark if it is leaf this requires that each node value has space to store the mark bit this might be true iffor examplethe node value were stored as -byte integer but the range of the values sored was small enough so that not all bits are used an example would be if all node values must be positive then the high-order (signbit of the integer value could be used as the mark bit another approach is to store separate bit vector to represent the status of each node in this caseeach node of the tree corresponds to one bit in the bit vector value of ' could indicate an internal nodeand ' could indicate leaf node example the bit vector for the tree if figure would be ( storing general trees by means of sequential implementation requires that more explicit structural information be included with the node list not only must the general tree implementation indicate whether node is leaf or internalit must also indicate how many children the node has alternativelythe implementation can indicate when node' child list has come to an end the next example dispenses with marks for internal or leaf nodes instead it includes special mark (we