Self Balancing BST in JavaScript
Last Updated :
23 Jul, 2025
A self-balancing binary search tree (BST) is a type of binary search tree that automatically keeps its height balanced in order to guarantee that operations such as searching, inserting, and deleting elements in the tree take less time on average.
How do self-balancing BSTs maintain height balance?
Self-balancing binary search trees (BSTs) maintain height balance by automatically reorganising the tree after every insertion or deletion operation. To balance a BST, we can use two common operations: right rotation and left rotation. These operations adjust the positions of nodes in the tree to ensure that the tree remains balanced.
Right Rotation: Right rotation is used to balance a tree when its left subtree is longer than its right subtree.
In a right rotation, we move the left child of the unbalanced node to the position of the unbalanced node, while making the unbalanced node the right child of its former left child.
For example, let's say we have a tree where node B is the root, and its left child A is taller than its right child C. In this case, we can perform a right rotation on node B as follows:
Example of right rotation
Left Rotation: Left rotation is used to balance a tree when its right subtree is longer than its left subtree.
In a left rotation, we move the right child of the unbalanced node to the position of the unbalanced node, while making the unbalanced node the left child of its former right child.
For example, let's say we have a tree where node B is the root, and its right child C is taller than its left child A. In this case, we can perform a left rotation on node B as follows:
Example of left rotationSome examples of self-balancing BST:
Some examples of self-balancing BSTs are:
Below we will check their implementation in Javascript language.
Implementation of AVL Tree in Javascript:
This implementation includes methods for inserting, searching, and deleting nodes from the AVL tree.
- The `height` method calculates the height of a given node, and
- the `balanceFactor` method calculates the difference in height between the left and right subtrees of a given node.
- The `rotateRight` and `rotateLeft` methods perform right and left rotations, respectively, to balance the tree.
- The `insertNode` method inserts a new node into the tree, and
- The `deleteNode` method removes a node from the tree.
- The `findMinNode` method finds the minimum node in a given subtree,
- The `searchNode` method searches for a node with a given value in the tree.
Below is the implementation of AVL Tree in Javascript.
JavaScript
class Node {
constructor(value) {
this.value = value;
this.left = null;
this.right = null;
this.height = 1;
}
}
class AVLTree {
constructor() {
this.root = null;
}
// get the height of a node
height(node) {
if (!node) return 0;
return node.height;
}
// get the balance factor of a node
balanceFactor(node) {
if (!node) return 0;
return this.height(node.left) - this.height(node.right);
}
// perform a right rotation
rotateRight(node) {
const leftNode = node.left;
const rightOfLeftNode = leftNode.right;
leftNode.right = node;
node.left = rightOfLeftNode;
node.height = Math.max(this.height(node.left), this.height(node.right)) + 1;
leftNode.height =
Math.max(this.height(leftNode.left), this.height(leftNode.right)) + 1;
return leftNode;
}
// perform a left rotation
rotateLeft(node) {
const rightNode = node.right;
const leftOfRightNode = rightNode.left;
rightNode.left = node;
node.right = leftOfRightNode;
node.height = Math.max(this.height(node.left), this.height(node.right)) + 1;
rightNode.height =
Math.max(this.height(rightNode.left), this.height(rightNode.right)) + 1;
return rightNode;
}
// insert a new node
insert(value) {
this.root = this.insertNode(this.root, value);
}
insertNode(node, value) {
if (!node) {
return new Node(value);
}
if (value < node.value) {
node.left = this.insertNode(node.left, value);
} else if (value > node.value) {
node.right = this.insertNode(node.right, value);
} else {
return node; // duplicate values are not allowed
}
node.height = Math.max(this.height(node.left), this.height(node.right)) + 1;
const balance = this.balanceFactor(node);
if (balance > 1 && value < node.left.value) {
return this.rotateRight(node);
}
if (balance > 1 && value > node.left.value) {
node.left = this.rotateLeft(node.left);
return this.rotateRight(node);
}
if (balance < -1 && value > node.right.value) {
return this.rotateLeft(node);
}
if (balance < -1 && value < node.right.value) {
node.right = this.rotateRight(node.right);
return this.rotateLeft(node);
}
return node;
}
// search for a node
search(value) {
return this.searchNode(this.root, value);
}
searchNode(node, value) {
if (!node) return null;
if (value < node.value) {
return this.searchNode(node.left, value);
} else if (value > node.value) {
return this.searchNode(node.right, value);
} else {
return node;
}
}
// delete a node
delete(value) {
this.root = this.deleteNode(this.root, value);
}
deleteNode(node, value) {
if (!node) {
return null;
}
if (value < node.value) {
node.left = this.deleteNode(node.left, value);
} else if (value > node.value) {
node.right = this.deleteNode(node.right, value);
} else {
// node to be deleted has no children
if (!node.left && !node.right) {
node = null;
}
// node to be deleted has one child
else if (!node.left) {
node = node.right;
} else if (!node.right) {
node = node.left;
}
// node to be deleted has two children
else {
const minNode = this.findMinNode(node.right);
node.value = minNode.value;
node.right = this.deleteNode(node.right, minNode.value);
}
}
if (!node) return null;
node.height = Math.max(this.height(node.left), this.height(node.right)) + 1;
const balance = this.balanceFactor(node);
if (balance > 1 && this.balanceFactor(node.left) >= 0) {
return this.rotateRight(node);
}
if (balance > 1 && this.balanceFactor(node.left) < 0) {
node.left = this.rotateLeft(node.left);
return this.rotateRight(node);
}
if (balance < -1 && this.balanceFactor(node.right) <= 0) {
return this.rotateLeft(node);
}
if (balance < -1 && this.balanceFactor(node.right) > 0) {
node.right = this.rotateRight(node.right);
return this.rotateLeft(node);
}
return node;
}
// find the minimum node in a subtree
findMinNode(node) {
while (node && node.left) {
node = node.left;
}
return node;
}
}
// example usage
const tree = new AVLTree();
tree.insert(4);
tree.insert(2);
tree.insert(7);
tree.insert(1);
tree.insert(3);
tree.insert(5);
tree.insert(8);
tree.insert(6);
console.log(tree.search(5));
tree.delete(7);
console.log(tree.search(7));
Output:
Output of the above codeImplementation of Red-Black Tree in Javascript:
- The `insert()` method first inserts a new node using the `insertNode()` method (which is the same as in a regular binary search tree).
- Ihe `fixupInsert()` method fix any violations of the red-black properties that may have been introduced by the insertion.
- The `fixupInsert()` method checks three cases to determine how to fix the violation. In each case, it performs a rotation (either left or right) to re-balance the tree.
- The `rotateLeft()` and `rotateRight()` methods perform the actual rotations, and
- The `search()` method searches for a value in the tree.
- Finally, the `inOrderTraversal()` method traverses the tree in order and calls a callback function on each node.
Below is the implementation of Red-Black Tree.
JavaScript
// Define the color constants
const RED = "red";
const BLACK = "black";
class RBNode {
constructor(value) {
this.value = value;
this.color = RED;
this.left = null;
this.right = null;
this.parent = null;
}
isRed() {
return this.color === RED;
}
}
class RBTree {
constructor() {
this.root = null;
}
insert(value) {
const node = new RBNode(value);
// insert node like in a regular BST
this.root = this.insertNode(this.root, node);
// fix any violations of the red-black properties
this.fixupInsert(node);
}
insertNode(root, node) {
if (!root) {
return node;
}
if (node.value < root.value) {
root.left = this.insertNode(root.left, node);
root.left.parent = root;
} else {
root.right = this.insertNode(root.right, node);
root.right.parent = root;
}
return root;
}
fixupInsert(node) {
while (node.parent && node.parent.isRed()) {
if (node.parent === node.parent.parent.left) {
const uncle = node.parent.parent.right;
if (uncle && uncle.isRed()) {
// case 1: uncle is red
node.parent.color = BLACK;
uncle.color = BLACK;
node.parent.parent.color = RED;
node = node.parent.parent;
} else {
if (node === node.parent.right) {
// case 2: uncle is black and node is a right child
node = node.parent;
this.rotateLeft(node);
}
// case 3: uncle is black and node is a left child
node.parent.color = BLACK;
node.parent.parent.color = RED;
this.rotateRight(node.parent.parent);
}
} else {
const uncle = node.parent.parent.left;
if (uncle && uncle.isRed()) {
// case 1: uncle is red
node.parent.color = BLACK;
uncle.color = BLACK;
node.parent.parent.color = RED;
node = node.parent.parent;
} else {
if (node === node.parent.left) {
// case 2: uncle is black and node is a left child
node = node.parent;
this.rotateRight(node);
}
// case 3: uncle is black and node is a right child
node.parent.color = BLACK;
node.parent.parent.color = RED;
this.rotateLeft(node.parent.parent);
}
}
}
this.root.color = BLACK;
}
rotateLeft(node) {
const right = node.right;
node.right = right.left;
if (right.left) {
right.left.parent = node;
}
right.parent = node.parent;
if (!node.parent) {
this.root = right;
} else if (node === node.parent.left) {
node.parent.left = right;
} else {
node.parent.right = right;
}
right.left = node;
node.parent = right;
}
rotateRight(node) {
const left = node.left;
node.left = left.right;
if (left.right) {
left.right.parent = node;
}
left.parent = node.parent;
if (!node.parent) {
this.root = left;
} else if (node === node.parent.left) {
node.parent.left = left;
} else {
node.parent.right = left;
}
left.right = node;
node.parent = left;
}
// search for a value in the tree
search(value) {
let current = this.root;
while (current) {
if (value === current.value) {
return current;
} else if (value < current.value) {
current = current.left;
} else {
current = current.right;
}
}
return null;
}
// traverse the tree in order
inOrderTraversal(callback) {
this.inOrderTraversalNode(this.root, callback);
}
inOrderTraversalNode(node, callback) {
if (node) {
this.inOrderTraversalNode(node.left, callback);
callback(node);
this.inOrderTraversalNode(node.right, callback);
}
}
}
const tree = new RBTree();
tree.insert(10);
tree.insert(20);
tree.insert(30);
tree.insert(15);
tree.insert(5);
console.log("Inorder Traversal of the Red Black Tree: ");
tree.inOrderTraversal((node) => console.log(node.value));
OutputInorder Traversal of the Red Black Tree:
5
10
15
20
30
Implementation of Splay Tree in Javascript:
The splay tree is constructed in the same way as a binary search tree, but it is different in the way it is manipulated. Whenever an element is accessed, it is moved to the root of the tree by performing a series of rotations. This process is called splaying, and it helps to ensure that frequently accessed elements are located near the root of the tree, making them easier to access in future operations.
Here are the steps to implement a splay tree:
- Define a Node class to represent nodes in the tree. Each node should have a key, a value, a left child, and a right child.
- Define a SplayTree class to represent the tree itself. The tree should have a root property that points to the root node.
- Implement the basic operations of a binary search tree, such as insert, delete, and search. These operations should follow the standard algorithms for binary search trees, with the additional step of performing a splaying operation after the insertion, deletion, or search.
- Implement the splaying operation. The splaying operation should take a key as input and move the corresponding node to the root of the tree using a series of rotations. The rotations should be performed in a way that balances the tree and reduces its height.
Below is the implementation of the Splay Tree.
JavaScript
class Node {
constructor(key, value) {
this.key = key;
this.value = value;
this.left = null;
this.right = null;
}
}
class SplayTree {
constructor() {
this.root = null;
}
splay(key) {
if (this.root == null) {
return;
}
let dummy = new Node(null, null);
let left = dummy;
let right = dummy;
let current = this.root;
while (true) {
if (key < current.key) {
if (current.left == null) {
break;
}
if (key < current.left.key) {
let temp = current.left;
current.left = temp.right;
temp.right = current;
current = temp;
if (current.left == null) {
break;
}
}
right.left = current;
right = current;
current = current.left;
} else if (key > current.key) {
if (current.right == null) {
break;
}
if (key > current.right.key) {
let temp = current.right;
current.right = temp.left;
temp.left = current;
current = temp;
if (current.right == null) {
break;
}
}
left.right = current;
left = current;
current = current.right;
} else {
break;
}
}
left.right = current.left;
right.left = current.right;
current.left = dummy.right;
current.right = dummy.left;
this.root = current;
}
insert(key, value) {
if (this.root == null) {
this.root = new Node(key, value);
return;
}
this.splay(key);
if (key < this.root.key) {
let node = new Node(key, value);
node.left = this.root.left;
node.right = this.root;
this.root.left = null;
this.root = node;
} else if (key > this.root.key) {
let node = new Node(key, value);
node.right = this.root.right;
node.left = this.root;
this.root.right = null;
this.root = node;
} else {
this.root.value = value;
}
}
search(key) {
if (this.root == null) {
return null;
}
this.splay(key);
if (this.root.key == key) {
return this.root.value;
} else {
return null;
}
}
delete(key) {
if (this.root == null) {
return;
}
this.splay(key);
if (this.root.key != key) {
return;
}
if (this.root.left == null) {
this.root = this.root.right;
} else {
let right = this.root.right;
this.root = this.root.left;
this.splay(key);
this.root.right = right;
}
}
}
const tree = new SplayTree();
// Insert some nodes
tree.insert(10, 'A');
tree.insert(20, 'B');
tree.insert(30, 'C');
tree.insert(15, 'D');
tree.insert(25, 'E');
// Search for a node
// Output: "B"
console.log(tree.search(20));
// Delete a node
tree.delete(15);
// Search for a deleted node
// Output: null
console.log(tree.search(15));
Output:
Output of the above code
Similar Reads
JavaScript Tutorial JavaScript is a programming language used to create dynamic content for websites. It is a lightweight, cross-platform, and single-threaded programming language. It's an interpreted language that executes code line by line, providing more flexibility.Client Side: On the client side, JavaScript works
11 min read
JavaScript Basics
Introduction to JavaScriptJavaScript is a versatile, dynamically typed programming language that brings life to web pages by making them interactive. It is used for building interactive web applications, supports both client-side and server-side development, and integrates seamlessly with HTML, CSS, and a rich standard libra
4 min read
JavaScript VersionsJavaScript is a popular programming language used by developers all over the world. It’s a lightweight and easy-to-learn language that can run on both the client-side (in your browser) and the server-side (on the server). JavaScript was created in 1995 by Brendan Eich.In 1997, JavaScript became a st
2 min read
How to Add JavaScript in HTML Document?To add JavaScript in HTML document, several methods can be used. These methods include embedding JavaScript directly within the HTML file or linking an external JavaScript file.Inline JavaScriptYou can write JavaScript code directly inside the HTML element using the onclick, onmouseover, or other ev
3 min read
JavaScript SyntaxJavaScript syntax refers to the rules and conventions dictating how code is structured and arranged within the JavaScript programming language. This includes statements, expressions, variables, functions, operators, and control flow constructs.Syntaxconsole.log("Basic Print method in JavaScript");Ja
6 min read
JavaScript OutputJavaScript provides different methods to display output, such as console.log(), alert(), document.write(), and manipulating HTML elements directly. Each method has its specific use cases, whether for debugging, user notifications, or dynamically updating web content. Here we will explore various Jav
4 min read
JavaScript CommentsComments help explain code (they are not executed and hence do not have any logic implementation). We can also use them to temporarily disable parts of your code.1. Single Line CommentsA single-line comment in JavaScript is denoted by two forward slashes (//), JavaScript// A single line comment cons
2 min read
JS Variables & Datatypes
Variables and Datatypes in JavaScriptVariables and data types are foundational concepts in programming, serving as the building blocks for storing and manipulating information within a program. In JavaScript, getting a good grasp of these concepts is important for writing code that works well and is easy to understand.Data TypesVariabl
6 min read
Global and Local variables in JavaScriptIn JavaScript, understanding the difference between global and local variables is important for writing clean, maintainable, and error-free code. Variables can be declared with different scopes, affecting where and how they can be accessed. Global VariablesGlobal variables in JavaScript are those de
4 min read
JavaScript LetThe let keyword is a modern way to declare variables in JavaScript and was introduced in ECMAScript 6 (ES6). Unlike var, let provides block-level scoping. This behaviour helps developers avoid unintended issues caused by variable hoisting and scope leakage that are common with var.Syntaxlet variable
6 min read
JavaScript constThe const keyword in JavaScript is a modern way to declare variables, introduced in (ES6). It is used to declare variables whose values need to remain constant throughout the lifetime of the application.const is block-scoped, similar to let, and is useful for ensuring immutability in your code. Unli
5 min read
JavaScript Var StatementThe var keyword is used to declare variables in JavaScript. It has been part of the language since its inception. When a variable is declared using var, it is function-scoped or globally-scoped, depending on where it is declared.Syntaxvar variable = value;It declares a variable using var, assigns it
7 min read
JS Operators
JavaScript OperatorsJavaScript operators are symbols or keywords used to perform operations on values and variables. They are the building blocks of JavaScript expressions and can manipulate data in various ways.There are various operators supported by JavaScript:1. JavaScript Arithmetic OperatorsArithmetic Operators p
5 min read
Operator precedence in JavaScriptOperator precedence refers to the priority given to operators while parsing a statement that has more than one operator performing operations in it. Operators with higher priorities are resolved first. But as one goes down the list, the priority decreases and hence their resolution. ( * ) and ( / )
2 min read
JavaScript Arithmetic OperatorsJavaScript Arithmetic Operators are the operator that operate upon the numerical values and return a numerical value. Addition (+) OperatorThe addition operator takes two numerical operands and gives their numerical sum. It also concatenates two strings or numbers.JavaScript// Number + Number =>
5 min read
JavaScript Assignment OperatorsAssignment operators are used to assign values to variables in JavaScript.JavaScript// Lets take some variables x = 10 y = 20 x = y ; console.log(x); console.log(y); Output20 20 More Assignment OperatorsThere are so many assignment operators as shown in the table with the description.OPERATOR NAMESH
5 min read
JavaScript Comparison OperatorsJavaScript comparison operators are essential tools for checking conditions and making decisions in your code. 1. Equality Operator (==) The Equality operator is used to compare the equality of two operands. JavaScript// Illustration of (==) operator let x = 5; let y = '5'; // Checking of operands c
5 min read
JavaScript Logical OperatorsLogical operators in JavaScript are used to perform logical operations on values and return either true or false. These operators are commonly used in decision-making statements like if or while loops to control the flow of execution based on conditions.In JavaScript, there are basically three types
5 min read
JavaScript Bitwise OperatorsIn JavaScript, a number is stored as a 64-bit floating-point number but bitwise operations are performed on a 32-bit binary number. To perform a bit-operation, JavaScript converts the number into a 32-bit binary number (signed) and performs the operation and converts back the result to a 64-bit numb
5 min read
JavaScript Ternary OperatorThe Ternary Operator in JavaScript is a conditional operator that evaluates a condition and returns one of two values based on whether the condition is true or false. It simplifies decision-making in code, making it more concise and readable. Syntaxcondition ? trueExpression : falseExpressionConditi
4 min read
JavaScript Comma OperatorJavaScript Comma Operator mainly evaluates its operands from left to right sequentially and returns the value of the rightmost operand. JavaScriptlet x = (1, 2, 3); console.log(x); Output3 Here is another example to show that all expressions are actually executed.JavaScriptlet a = 1, b = 2, c = 3; l
2 min read
JavaScript Unary OperatorsJavaScript Unary Operators work on a single operand and perform various operations, like incrementing/decrementing, evaluating data type, negation of a value, etc.Unary Plus (+) OperatorThe unary plus (+) converts an operand into a number, if possible. It is commonly used to ensure numerical operati
4 min read
JavaScript in and instanceof operatorsJavaScript Relational Operators are used to compare their operands and determine the relationship between them. They return a Boolean value (true or false) based on the comparison result.JavaScript in OperatorThe in-operator in JavaScript checks if a specified property exists in an object or if an e
3 min read
JavaScript String OperatorsJavaScript String Operators are used to manipulate and perform operations on strings. There are two operators which are used to modify strings in JavaScript. These operators help us to join one string to another string.1. Concatenate OperatorConcatenate Operator in JavaScript combines strings using
3 min read
JS Statements
JS Loops
JavaScript LoopsLoops in JavaScript are used to reduce repetitive tasks by repeatedly executing a block of code as long as a specified condition is true. This makes code more concise and efficient.Suppose we want to print 'Hello World' five times. Instead of manually writing the print statement repeatedly, we can u
3 min read
JavaScript For LoopJavaScript for loop is a control flow statement that allows code to be executed repeatedly based on a condition. It consists of three parts: initialization, condition, and increment/decrement. Syntaxfor (statement 1 ; statement 2 ; statement 3){ code here...}Statement 1: It is the initialization of
4 min read
JavaScript While LoopThe while loop executes a block of code as long as a specified condition is true. In JavaScript, this loop evaluates the condition before each iteration and continues running as long as the condition remains true.Syntaxwhile (condition) { Code block to be executed}Here's an example that prints from
3 min read
JavaScript For In LoopThe JavaScript for...in loop iterates over the properties of an object. It allows you to access each key or property name of an object.JavaScriptconst car = { make: "Toyota", model: "Corolla", year: 2020 }; for (let key in car) { console.log(`${key}: ${car[key]}`); }Outputmake: Toyota model: Corolla
3 min read
JavaScript for...of LoopThe JavaScript for...of loop is a modern, iteration statement introduced in ECMAScript 2015 (ES6). Works for iterable objects such as arrays, strings, maps, sets, and more. It is better choice for traversing items of iterables compared to traditional for and for in loops, especially when we have bre
3 min read
JavaScript do...while LoopA do...while loop in JavaScript is a control structure where the code executes repeatedly based on a given boolean condition. It's similar to a repeating if statement. One key difference is that a do...while loop guarantees that the code block will execute at least once, regardless of whether the co
4 min read
JS Perfomance & Debugging
JS Object
Objects in JavascriptAn object in JavaScript is a data structure used to store related data collections. It stores data as key-value pairs, where each key is a unique identifier for the associated value. Objects are dynamic, which means the properties can be added, modified, or deleted at runtime.There are two primary w
4 min read
Introduction to Object Oriented Programming in JavaScriptAs JavaScript is widely used in Web Development, in this article we will explore some of the Object Oriented mechanisms supported by JavaScript to get the most out of it. Some of the common interview questions in JavaScript on OOPS include: How is Object-Oriented Programming implemented in JavaScrip
7 min read
JavaScript ObjectsIn our previous article on Introduction to Object Oriented Programming in JavaScript we have seen all the common OOP terminology and got to know how they do or don't exist in JavaScript. In this article, objects are discussed in detail.Creating Objects:In JavaScript, Objects can be created using two
6 min read
Creating objects in JavaScriptAn object in JavaScript is a collection of key-value pairs, where keys are strings (properties) and values can be any data type. Objects can be created using object literals, constructors, or classes. Properties are defined with key-value pairs, and methods are functions defined within the object, e
5 min read
JavaScript JSON ObjectsJSON (JavaScript Object Notation) is a handy way to share data. It's easy for both people and computers to understand. In JavaScript, JSON helps organize data into simple objects. Let's explore how JSON works and why it's so useful for exchanging information.const jsonData = { "key1" : "value1", ...
3 min read
JavaScript Object ReferenceJavaScript Objects are the most important data type and form the building blocks for modern JavaScript. The "Object" class represents the JavaScript data types. Objects are quite different from JavaScript’s primitive data types (Number, String, Boolean, null, undefined, and symbol). It is used to st
4 min read
JS Function
Functions in JavaScriptFunctions in JavaScript are reusable blocks of code designed to perform specific tasks. They allow you to organize, reuse, and modularize code. It can take inputs, perform actions, and return outputs.JavaScriptfunction sum(x, y) { return x + y; } console.log(sum(6, 9)); // output: 15Function Syntax
4 min read
How to write a function in JavaScript ?JavaScript functions serve as reusable blocks of code that can be called from anywhere within your application. They eliminate the need to repeat the same code, promoting code reusability and modularity. By breaking down a large program into smaller, manageable functions, programmers can enhance cod
4 min read
JavaScript Function CallThe call() method is a predefined JavaScript method. It can be used to invoke (call) a method with an owner object as an argument (parameter). This allows borrowing methods from other objects, executing them within a different context, overriding the default value, and passing arguments. Syntax: cal
2 min read
Different ways of writing functions in JavaScriptA JavaScript function is a block of code designed to perform a specific task. Functions are only executed when they are called (or "invoked"). JavaScript provides different ways to define functions, each with its own syntax and use case.Below are the ways of writing functions in JavaScript:Table of
3 min read
Difference between Methods and Functions in JavaScriptGrasping the difference between methods and functions in JavaScript is essential for developers at all levels. While both are fundamental to writing effective code, they serve different purposes and are used in various contexts. This article breaks down the key distinctions between methods and funct
3 min read
Explain the Different Function States in JavaScriptIn JavaScript, we can create functions in many different ways according to the need for the specific operation. For example, sometimes we need asynchronous functions or synchronous functions. Â In this article, we will discuss the difference between the function Person( ) { }, let person = Person ( )
3 min read
JavaScript Function Complete ReferenceA JavaScript function is a set of statements that takes inputs, performs specific computations, and produces outputs. Essentially, a function performs tasks or computations and then returns the result to the user.Syntax:function functionName(Parameter1, Parameter2, ..) { // Function body}Example: Be
3 min read
JS Array
JavaScript ArraysIn JavaScript, an array is an ordered list of values. Each value is called an element, and each element has a numeric position in the array, known as its index. Arrays in JavaScript are zero-indexed, meaning the first element is at index 0, the second at index 1, and so on.Array in JavaScriptWhy Use
6 min read
JavaScript Array MethodsTo help you perform common tasks efficiently, JavaScript provides a wide variety of array methods. These methods allow you to add, remove, find, and transform array elements with ease.Javascript Arrays MethodsLearn More on JavaScript Array1. JavaScript Array length The length property of an array re
7 min read
Best-Known JavaScript Array MethodsAn array is a special variable in all programming languages used to store multiple elements. JavaScript array come with built-in methods that every developer should know how to use. These methods help in adding, removing, iterating, or manipulating data as per requirements.There are some Basic JavaS
6 min read
Important Array Methods of JavaScriptJavaScript arrays are powerful tools for managing collections of data. They come with a wide range of built-in methods that allow developers to manipulate, transform, and interact with array elements.Some of the most important array methods in JavaScript areTable of Content1. JavaScript push() Metho
7 min read
JavaScript Array ReferenceJavaScript Array is used to store multiple elements in a single variable. It can hold various data types, including numbers, strings, objects, and even other arrays. It is often used when we want to store a list of elements and access them by a single variable.Syntax:const arr = ["Item1", "Item2", "
4 min read