Are empty Binary Search Trees valid?

Question

I have two questions regarding binary search trees, both about empty trees.

1. Is an empty tree (null) valid?
2. Is a root node without children valid?

Answer 1

Yes both conditions are true. For a binary tree, each node can have zero, one, or two children. If a tree has only a root node and no other node then it is called a NULL tree.