A node that contains data records.

Leaf nodes are tree nodes that do not have branches. Leaf nodes cannot have child nodes.

A node in a tree that has exactly one connecting edge. In particular, in a directed tree a leaf node has no outgoing edges and exactly one incoming edge. See Also Directed, Tree.

The device that is at the end, or last device, of a given I/O tree. See also Internal Node .

Is a node, that cannot be further splitted. It represents a class, a group or a decision in Decision Trees.

a category that has no children and can be determined through the use of a simple query

an end point in the tree

a node with no concepts beneath it

a node with no outgoing edges

a node without children

in a tree graph node connected to only a single edge.

A node that has no children before it in the directory tree.

A node of a tree is a leaf node if it has no children.

A node within a scene graph that contains the visual, auditory, and behavioral components of the scene. See also group node, root node.

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).