#data-structures

Read more stories on Hashnode

Articles with this tag

An unbalanced binary search tree has the worst case search time of O(n). Therefore, balancing the tree will make search time more efficient. AVL Tree,...

Insertion sort is a simple , adaptive , stable , Inplace sorting algorithm. Insertion sort is an online algorithm i.e. insertion sort can sort its...

Bubble Sort also known as Sinking sort. It is the easiest sorting algorithm. Bubble sort compares adjacent elements from left to right and swaps them...

Sorting refers to arranging a list of elements into a particular order , which may be ascending or descending. Several programming solutions rely on...

Tree traversal (also known as tree search) is a form of graph traversal and refers to the process of visiting (checking and/or updating) each node in...

Binary search tree is a special kind of tree which is an efficient data structure to organize data for quick search as well as quick updates. The...