chap non-binary trees root ancestors of parent of siblings of subtree rooted at children of figure notation for general trees node is the parent of nodes vs and thusvs and are children of nodes and are ancestors of nodes vs and are called siblings the oval surrounds the subtree having as its root into > disjoint subsets tn- each of which is treeand whose roots rn respectivelyare children of the subsets ti ( < nare said to be subtrees of these subtrees are ordered in that ti is said to come before tj if by conventionthe subtrees are arranged from left to right with subtree called the leftmost child of node' out degree is the number of children for that node forest is collection of one or more trees figure presents further tree notation generalized from the notation for binary trees presented in each node in tree has precisely one parentexcept for the rootwhich has no parent from this observationit immediately follows that tree with nodes must have edges because each nodeaside from the roothas one edge connecting that node to its parent an adt for general tree nodes before discussing general tree implementationswe should first make precise what operations such implementations must support any implementation must be able to initialize tree given treewe need access to the root of that tree there must be some way to access the children of node in the case of the adt for binary tree nodesthis was done by providing member functions that give explicit