ABSTRACT

A binary tree is a tree in which no node can have more than two children (referred to as the left child and the right child). Based on the definition of binary tree, there are a lot of important data structures, such as heap, Huffman tree, and binary search tree.