 If an internal node, or a node present in the tree, has fewer than two child nodes, then additional child nodes, called external nodes, are added so that each internal node has two children.By doing so, an unsuccessful search can be represented as a path to an external node, whose parent is the single element that remains during the last iteration.An "external path" is a path from the root to an external node.