Geeky Girlgeekygrl.hashnode.dev·Dec 14, 2022Binary Search TreeA 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 "binary" search tree because each node has at most two children, and it is called a "search" tree because ...Discuss·48 readsbinary search

Geeky Girlgeekygrl.hashnode.dev·Dec 14, 2022Binary TreeTraversals Preorder (DFS) Operations order: root -> left -> right Inorder (DFS) Operations order: left -> node -> right Postorder (DFS) Operations order: reft -> right -> root Operations order: right -> left -> root [Reverse post order] ...Discuss·42 readsBinaryTrees

Geeky Girlgeekygrl.hashnode.dev·Dec 14, 2022Introduction - TreeDefinition 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 the tree is a root node, which branches out into multiple child nodes. Each child node can then have i...Discuss·34 readsTree

Geeky Girlgeekygrl.hashnode.dev·Dec 10, 2022Dynamic ProgrammingConcept Definition Dynamic programming is a powerful technique for solving complex problems by breaking them down into smaller subproblems. This approach allows for the optimization of computational resources by avoiding redundant calculations and e...Discuss·79 readsDynamic Programming

Geeky Girlgeekygrl.hashnode.dev·Dec 10, 2022BacktrackingConcept Definition: Backtracking is a common technique used in computer programming to solve problems by exploring all possible solutions to a given problem and then choosing the best one. It is often used in situations where a problem has multiple ...Discuss·78 readsbacktracking

Geeky Girlgeekygrl.hashnode.dev·Dec 10, 2022RecursionDefinition 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 a problem in terms of itself. When a function calls itself. Recursion is often used in data struct...Discuss·60 readsRecursion

Geeky Girlgeekygrl.hashnode.dev·Dec 8, 2022Stack - Data StructureConcept 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 an array or a linked list. The basic operations that can be performed on a stack are: Push: Adds ...Discuss·76 readsstack

Geeky Girlgeekygrl.hashnode.dev·Dec 7, 2022Queue - Data StructureConcept Definition Linear data structure where operations are performed in First In First Out (FIFO) order. FIFO: push_back, pop_front. Time Complexity: Access -> at O(n). Deletion at O(1). Searching -> O(n) Insertion -> O(1) For all implem...Discuss·65 readspriority queue

Geeky Girlgeekygrl.hashnode.dev·Nov 20, 2022Binary SearchDefinition 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 is the number of elements in an array. It works by repeatedly dividing the search space in half unti...Discuss·49 readsbinary search

Geeky Girlgeekygrl.hashnode.dev·Nov 15, 2022Array - Data StructureConcept Same or similar data type at contiguous memory locations. Time Complexity: Access -> at O(1). Deletion at O(n). Searching -> O(n) Insertion -> O(n) Types: 1-dimensional Multi-dimesional Approaches For an array problem, these a...Discuss·1 like·68 readsarray