Short Summary

Binary Search Trees are constructed of nodes containing data.
The first or starting node is the root node with nodes on the left being of a lesser comparable value to those above it or on the right, with the ones on the right being of a greater comparable value to those on the left or above it.
Parent nodes are the nodes that are higher on the tree than the nodes they are linked to, while the child nodes are nodes that are below the node they are linked to.

A website that contains more information