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

A binary tree can be defined recursively as:

A single node with either no children, or with two children - 
each of which is a binary tree.