Quick Sort
The basic version of quick sort algorithm was invented by C. A. R. Hoare in 1960
and formally introduced quick sort in 1962. It is used on the principle of divide-andconquer. Quick sort is an algorithm of choice in many situations because it is

Introduction to Trees
Tree represents nodes connected by edges. It is used to represent hierarchical
data. So the required definition of tree shall be Tree is collection of entities
called nodes linked together to simulate hierarchical data.
Tree is a non

INFIX, POSTFIX, PREFIX
Operand: Objects in which operations are performed.
Infix notation: X + Y
Operators are written in-between their operands. This is the usual way
we write expressions. An expression such as A * ( B + C ) / D is usually
taken to mean

INTRODUCTION TO STACK
What is stack?
In computer science, a stack is an abstract data type that serves as a collection of elements, with two
principal operations: push, which adds an element to the collection, and pop, which removes the most
recently adde

What if the input to binary search tree comes in sorted (ascending or descending) manner? It will
then look like this
It is observed that BST's worst-case performance closes to linear search algorithms, that is (n).
In real time data we cannot predict da

CIRCULAR LINKED LIST
Circular Linked List is a variation of Linked list in which first element points to last element and last
element points to first element. Both Singly Linked List and Doubly Linked List can be made into as
circular linked list.
Singly