A binary Heap is a special kind of tree. For a Binary Tree to be a Binary Heap the rule is simple- Max Binary Heap- the parent node is always larger than the child nodes. Min Binary Heap- The parent node is always smaller than the children.
The Repository pattern just moves the Eloquent model usage to the repositories. We will use the repository from our controller to perform database operations. We will still be using the Eloquent models inside our repository.
Binary Search Tree or BST is a special type of tree that is used for organizing data in a way that searching becomes easier. The rule is simple for BST- Everything on the left of the node is smaller than the selected node. Everything on the right of the node is larger than the selected node.
We use the Stack data structure to create a pile of data/information one after another and then process those from top to bottom. Items of a stack are accessed/processed on a Last-in-First-out basis. Stack support push and pop from the top. In this article, we are discussing in detail, the implementation of Stack in JavaScript and TypeScript.
Queue data structures are created for maintaining a queue of tasks or processes, so that we can we can maintain the sequence of the items and process those one by one. First-in-First-out is used for processing a queue. In this article, we are discussing in detail, the implementation of Queue in JavaScript and TypeScript.
A singly linked list is a list of items, where each element has reference to the next element. Elements do not have info of the previous element. So we can only go to the next element while traversing a singly linked list. In this article, we are discussing in detail, the implementation of Singly Linked List in JavaScript and TypeScript.
Process or calculate aggregated values from a collection or view. The processing steps are mentioned in different stages. We can perform operations like grouping, filtering, and/or any general calculation using the aggregation pipeline.
Get full information on all existing indexes of a collection. Hidden indexes are also included in the result of this method.
