TREE

A tree is a nonlinear data structure in which the elements are arranged in the parent and child relationship manner. In the tree data structure the elements can also be stored in a sorted order, and is used to represent the hierarchical relationship. The binary tree are of four types such as complete binary tree, almost complete binary tree, strictly binary tree, and extended binary tree. A binary tree can be represented by using array and linked list. The most commonly implemented operations with the binary tree are: creation, insertion, deletion, searching, copying, merging, and updating. The tree traversing is the way to visit all the nodes of the tree on a specific order. There are different types of binary trees are found but some of them which are frequently used are: expression tree, binary search tree, height balanced tree, threaded binary tree, heap tree, Huffman tree, decision tree, and red black tree.