#data-structures
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...
Definition A tree is a data structure that is commonly used in computer science to store and organize data in a hierarchical manner. At the top of...
Concept Definition Dynamic programming is a powerful technique for solving complex problems by breaking them down into smaller subproblems. This...
Concept Definition: Backtracking is a common technique used in computer programming to solve problems by exploring all possible solutions to a given...
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...
