What is strictly binary tree?

If every non-terminal node (any node except root node whose degree is not zero) in a binary tree consists of non-empty left and right subtree, then such a tree is called strictly binary tree.