9, 14, 19, 67 and 76 are leaf nodes.

In computer science, a leaf node is a node of a tree data structure that has zero child nodes. Often, leaf nodes are the nodes farthest from the root node. In the graph theory tree, a leaf node is a vertex of degree 1 other than the root (except when the tree has only one vertex; then the root, too, is a leaf). created by me(Noldoaran) in OOo Draw File history Legend: (cur) = this is the current file, (del) = delete this old version, (rev) = revert to this old version. ... created by me(Noldoaran) in OOo Draw File history Legend: (cur) = this is the current file, (del) = delete this old version, (rev) = revert to this old version. ... Computer science, or computing science, is the study of the theoretical foundations of information and computation and their implementation and application in computer systems. ... A node is a basic unit used to build data structures, such as linked lists and tree data structures. ... In computer science, a tree is a widely-used computer data structure that emulates a tree structure with a set of linked nodes. ... A child node or descendant node is a node in a tree data structure that is linked to by a parent node. ... A root node is a specially chosen node in a tree data structure at which all operations on the tree begin. ...

A non-leaf node is called an internal node. Some trees only store data in internal nodes, though this affects the dynamics of storing data in the tree. For example, with empty leaves, one can store an empty tree with a single leaf node. However with leaves that can store data, it is impossible to store an empty tree unless one stores some kind of marker data in the leaf that signifies that the leaf is to be empty (and thus the tree to be empty as well). In computer science, an internal node or inner node is any node of a tree data structure that is not a leaf node. ...

Conversely, some trees only store data in the leaf nodes, and use the internal nodes to hold other metadata, such as the range of values in the subtree rooted at that node. This type of tree is useful for range queries.

Genetic programming

In tree based genetic programming a leaf (also called a terminal) is the outermost part of a program tree. In contrast to functions or internal nodes, leaves have no arguments. In many cases in GP leaves are the inputs to the program. [1] Genetic programming (GP) is an automated methodology inspired by biological evolution to find computer programs that best perform a user-defined task. ...

See also

• Binary tree