#algorithms

Read more stories on Hashnode

Articles with this tag

A binary search tree (BST) is a data structure that is commonly used in computer science to store and retrieve data efficiently. It is called a...

Traversals Preorder (DFS) Operations order: root -> left -> right Inorder (DFS) Operations order: left -> node -> right Postorder...

Concept Definition Dynamic programming is a powerful technique for solving complex problems by breaking them down into smaller subproblems. This...

Definition Recursion is a method of solving a problem by breaking it down into smaller, simpler subproblems. In other words, it is a way of defining...

Concept Definition A stack is a linear data structure that stores items in a Last-In/First-Out (LIFO) manner. A stack is typically implemented using...

Definition Binary Search is a searching algorithm which can be used on the sorted array to reduce the time complexity from O(n) to O(log n) where n...