In a Merkle tree, a non-leaf node (also called an interior or branch node) is any node above the bottom row. Each leaf node holds the hash of one piece of data, such as a transaction; each non-leaf node holds the hash of its children joined together. In a binary tree a parent has two children, and if a level has an odd number of nodes, some designs, including Bitcoin's, duplicate the last one. The single non-leaf node at the top is the Merkle root.
Non-leaf nodes are what make Merkle proofs short. To prove that a transaction belongs to a block, a prover supplies only the sibling hashes along the path from the leaf to the root; the verifier recomputes each parent in turn and checks that the result matches the root in the block header. For a block with about a thousand transactions, around ten hashes are enough. This underpins simplified payment verification in light wallets.
Ref 1070001234