Some Short Note - 3

Bubble Sort:
Bubble sort is a sorting method which repeatedly exchanges various pairs of data items until they are in order.

Leaf of a Tree:
A terminal node is called a leaf.

Depth of tree:
The depth of a tree is a maximum number nodes in a branch of T.

Binary Search:
A binary search is a technique for quickly locating  an item in a sequential list.

Binary Tree:
A binary tree is a finite set of nodes where each node contain a left pointer a right pointer and add a data element.

Difference between Copies and similar in a tree:
Binary tree T and T are said to be similar if they have the same structure or they have  same node.
The tree are said to be copies if they are similar and if they have the same contents at corresponding nodes.

Some Short Note - 2

Linear Array:
The simplest type of data structure is a linear array. Linear arrays are called one dimensional arrays because each element in such an array is referenced by one subscript.

Queue:
A queue also called a First-In First-Out (FIFO) system is a linear list in which deletions can take place only at one end of the list, the "front" of the list, and insertions can take place only at the other end of the list, the "rear" of the list.

Trees:
Data frequently contain a hierarchical relationship between various elements. The data structure which reflects this relationship is called a rooted true graph or simply a tree.

Complete Binary Tree:
A complete binary tree is a binary tree in which every level, except possibly the last, is completely field and all nodes are as for left as possible.