True$/$False$.$ Explain your answers

Every node in a binary tree has two children.

Some nodes in a binary tree can have more than one parent.

In a binary search tree, all the values in the left subtree of a node are less than the value of that node.

In a binary search tree, all the values in the left subtree of a node are less than the values in the right subtree of that node.

InOrder traversal of a binary search tree shows the values in sorted order.

PreOrder traversal of a binary search is exactly the reverse order of the PostOrder traversal of that tree.

When building a binary search tree by adding one value after another with a set of numbers, the shape of the tree has nothing to do with the order of values added.