In a BST the following is not true:

every node has exactly two branches (valid pointers)

all left sub-tree values are smaller that the parent node value

all right sub-tree values are larger that the parent node value

some nodes have 0 descendants