In graph theory and tree data structures, a leaf node is defined as a node that has no children. Therefore, its out-degree (number of children) is 0.