200
A rooted binary tree, where each nodes store a value (key) and have two sub-nodes or children. For any node, the left children must have lower values than the parent, and the right children must have higher values than the parent.
What is a Binary Search Tree?