Question

the node that has no children is referred as

Answer 1

Answer:

Nodes with no children are called leaves, or external nodes. Nodes which are not leaves are called internal nodes. Nodes with the same parent are called siblings.

Explanation:

hope it will help you!!

Answer 2

A node with no children is referred to as a leaf.

Explanation:

• A binary tree is made of nodes, wherein every node consists of a "left" reference, a "right" reference, and a data element.  
• Nodes with out a children are referred to as leaves, or external nodes. Nodes which aren't leaves are referred to as internal nodes.  
• Nodes with the equal parent are referred to as siblings.  
• In a tree data structure, the node which does not have a child is referred to as as LEAF Node.  
• In a tree data structure, the leaf nodes also are referred to as as External Nodes.  
• External node is likewise a node with out a child.