- Heap
Heap is a tree-based data structure in which all the nodes of the tree are in a specific order. Heap is a complete binary tree-based data structure. Heaps have specific ordering properties. The ordering can be one of two types: Max-Heap: The value of a node must be greater than or equal to the…
- CSS Introduction
CSS (Cascading Style Sheets) is used to style and lay out web pages — for example, to alter the font, color, size, and spacing of your content, split it into multiple columns, or add animations and other decorative features. It is a simple design language intended to simplify the process of making…
- Git branch
List all branches within a repository git branch //or git branch –list List all of remote branches git branch -a Create a local branch git branch {branch-name} Example: create a branch name test-100 git branch test-100 Check for the new created branch folaukaveinga@Folaus-MacBook-Pro-3 demo % git…
- Priority Queue
Priority queue is a data structure that extends the queue data structure with a priority dimension. Queue is a list of elements taken in the same order as they arrived. For instance, a line of people waiting to pay at the Supermarket behaves like a queue: first-in, first-served, or FIFO (first in,…
- Javascript Timing
Timing JavaScript code can be executed in time-intervals either by set a timeout and then execute a funciton or set an interval and then execute a function repeatedly. setTimeout(function, milliseconds) // wait 3 seconds and then execute function let timeout = setTimeout(function(){…