+0 -0
A binary tree is a tree data structure in which each node has at most two children, which are referred to as the left child and the right child. The root node is the topmost node in the tree and all other nodes can be reached from the root node by following the left or right child pointers.