The location of the deleted data must be flagged. 

Multiple data can be stored at the same location.

If the size of the table is , then we can store up to of data.

The hash function is some function.

In a binary tree, an inner node may have children.

In a binary tree, the depth of an inner node may be greater than the depth of a leaf element.

A binary tree may have more leaves than inner nodes.

The height of a binary tree with nodes is at most .