Algorithm

8 Types of Sort

Implement bubble sort, selection sort, insertion sort, shell sort, quick sort, heap sort, merge sort and radix sort

Is subTree

Implement an algorithm that checks whether one tree is a subtree of the other tree.

Lowest Common Ancestor in a Binary Tree

The lowest common ancestor is the lowest node in the tree that has both n1 and n2 as descendants, where n1 and n2 are the nodes for which we wish to find the...

List of depths

An algorithm that links nodes at the same depth to a linked list when a binary tree is given

Implement BFS with directed graph

implemented code that checks whether there is a path between nodes using graph and queue.

Implement Stack.Min() in O(1) time

implement stack with min() function

Implement three Stacks using one array

implemented to dynamically assign three stacks to one array.

Rotate90˚

Big-O