Search for a command to run...
Articles tagged with #data-structures
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, named after its inventors Adelson-Velsky and Landis, is a special variation of Binary Search Tree w...
Insertion sort is a simple , adaptive , stable , Inplace sorting algorithm. Insertion sort is an online algorithm i.e. insertion sort can sort its input piece by piece in a serial fashion. Insertion sort performs two operations: It scans through the...
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 if they are out of order. By Swfung8 - Own work, CC BY-SA 3.0, https://commons.wikimedia.org/w/inde...
Sorting refers to arranging a list of elements into a particular order , which may be ascending or descending. Several programming solutions rely on sorting algorithms. They are widely used in Making searching algorithms efficient. Making raw data ...
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 a tree data structure, exactly once. Such traversals are classified by the order in which the nodes ...
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 special property of a Binary search tree is Nodes in the left subtree of the root node have a value l...