Binary tree is a data structure who hava at most 2 children often called the right node and the left node.Each node (excluding a root) in a tree is associated by a coordinated edge from precisely one other node. This node is known as a parent. Then again, every node can be associated with discretionary

Bubble sorting as known as sink sorting is an east and simple sorting algorithm. This sorting algorithm is correlation based algorithm in which each pair of adjacent element is compared and the elements are swapped if they are not the right sequence. This algorithm is not good for the large data sets and not efficient

Selection sort is simple sorting algorithm. This arranging calculation is a set up correlation based calculation in which the array is divided into two sections, the arranged part at the left end and the unsorted part at the right end. At first, the arranged part is vacant and the unsorted part is the whole array.

A Heap is an extraordinary Tree-based information structure in which the tree is a proper binary tree. By and large, Heaps can be of two kinds: Max-Heap: In a Max-Heap the key present at the root hub must be most noteworthy among the keys present at all of it’s youngsters. A similar property must be

A method /function is defined by the user as per the requirement of the user/ programmer . To implement a user define function , a programmer must contain the following statements . Function initialization Method call i-e math.max(); Here, the code of the maximum of 3 numbers by using max function is given below: Program

Insertion sort is easy and simple algorithm that generate the final sorted array (or list) one item at a time. The array is looked successively and unsorted things are moved and embedded into the arranged sub-list . This algorithm is not suitable for large data sets than more advaned algo’s like quick and heap sorting