chap non-binary trees (af (bfigure general tree converted to the dynamic "left-child/right-siblingrepresentation compared to the representation of figure this representation requires less space ( (bfigure full and complete -ary trees (athis tree is full (but not complete(bthis tree is complete (but not fullexample of -ary tree because -ary tree nodes have fixed number of childrenunlike general treesthey are relatively easy to implement in generalk-ary trees bear many similarities to binary treesand similar implementations can be used for -ary tree nodes note that as becomes largethe potential number of null pointers growsand the difference between the required sizes for internal nodes and leaf nodes increases thusas becomes largerthe need to choose different implementations for the internal and leaf nodes becomes more pressing full and complete -ary trees are analogous to full and complete binary treesrespectively figure shows full and complete -ary trees for in practicemost applications of -ary trees limit them to be either full or complete many of the properties of binary trees extend to -ary trees equivalent theorems to those in section regarding the number of null pointers in -ary tree and the relationship between the number of leaves and the number of internal