Final answer:
The statement is false; an interior node has child nodes and is not a terminal node, while a leaf node does not have child nodes and is a terminal node.
Step-by-step explanation:
The statement 'An interior node is a leaf node' is false. In the context of data structures, specifically trees, an interior node (also known as an internal or inner node) is any node of a tree that has child nodes — it is not a terminal node. On the other hand, a leaf node (or external node) is a node that does not have child nodes; it is a terminal node. Thus, they represent different concepts within the structure of a tree.