Maruf Notes

The problem Given a sequence of numbers S1,S2...,Sn We have to find a sub-sequence R1,R2...Rn such that R1<R2<...<Rn ...

Quick sort is a divide and conquer inplace sorting algorithm. This is a preferable sorting algorithm for many practical applications b...

A graph G is a set of of vertices V and a set of edges E that connects the vertices. G = (V,E) This notation means V is a set of vertices ...

2-3-4 Tree is a perfectly balanced tree (all leafs are on the same level) with O(log n) worst case time for find, insert and remove o...

Splay tree is a balanced binary search tree. On average all operations take O(log n) time. Any sequence of k operations starting from an em...

A binary search tree is a binary tree such that for any node n, if a node x is in n's left subtree, x's key is smaller than n...

A tree is a collection of nodes and edges. Edges connects the edges together. In a tree there is one and only one path between any tw...