Definition 4.1 (pq-Extended Tree) Let T be a tree, and p > 0 and q > 0 be two integers.
Definition 4.1 (pq-Extended Tree) Let T be a tree, and p > 0 and q > 0 be two integers. The pqextended tree, Tpq, is constructed from T by adding p−1 ancestors to the root node, inserting q−1 children before the first and after the last child of each non-leaf node, and adding q children to each leaf of T. All newly inserted nodes are null nodes that do not occur in T.
the tree to extend
insert p-1 ancestors to the root node
add q children to each leaf node in t
the extended tree
the node type of the tree