GeezerVison

Trie

Trie is a type of k-ary search tree used for storing and searching a specific key from a set. Using Trie, search complexities can be brought to optimal limit (key length).

Binary Search Tree

A binary search tree follows some order to arrange the elements like the value of left node must be smaller than the parent node, and the value of right node must be greater than the parent node.

Path Finding Algorithms

Pathfinding algorithms are usually an attempt to solve the shortest and efficient path problems in graph theory. They try to find the best path given a starting point and ending point based on some predefined criteria.

Sorting Algorithms

Sorting is a process of ordering or placing a list of elements from a collection in some kind of order. It is nothing but storage of data in sorted order. It arranges the data in ascending and descending order which makes searching easier.