JavaScript Program to Find Maximum Width of Binary Tree
Last Updated :
27 Feb, 2024
The maximum width of a given binary tree can be calculated by finding the maximum of all the level widths. The maximum width of a Binary tree is the maximum number of nodes present at any level. The maximum width of the Binary tree will include only the present node and not include null nodes.
The maximum width of a Binary Tree
In this example, we are going to see what is the maximum width of a binary tree. The maximum width of a binary tree is the maximum number of nodes present at any level. The maximum number of nodes present is returned as the maximum width of a binary tree.
Maximum Width- The maximum width at level 0 is 1.
- The maximum width at level 1 is 2.
- The maximum width at level 2 is 3.
- The maximum width at level 3 is 3.
As the maximum width of the binary tree is 3 at level 2 and level 3. So the maximum width of a binary tree is 3.
There are several ways to find the maximum width of a Binary tree in JavaScript which are as follows:
Level order Traversal using a queue
The level order traversal of the binary tree can be used to find the maximum width of the binary tree using the level order traversal of a binary tree. Perform the level order traversal using a queue. We calculate the maximum width of a binary tree. Keep the count of nodes at each level stored in the queue which will return the maximum width of a binary tree. Return the maximum width of a binary tree.
Example: In this queue is used to traverse each level of the binary tree using the queue data structure. At each level, we update the maximum width of a binary tree. Lastly, we return the maximum width of the binary tree stored in the variable after completing the whole traversal of a binary tree.
JavaScript
class Node {
constructor(key) {
this.data = key;
this.left = null;
this.right = null;
}
}
function maxWidth(root) {
if (root === null) {
return 0;
}
let maxWidth = 0;
let queue = [];
queue.push(root);
while (queue.length > 0) {
let count = queue.length;
maxWidth = Math.max(maxWidth, count);
while (count > 0) {
let node = queue.shift();
if (node.left) {
queue.push(node.left);
}
if (node.right) {
queue.push(node.right);
}
count--;
}
}
return maxWidth;
}
// Example usage:
// Constructing a sample binary tree
let root = new Node(1);
root.left = new Node(2);
root.right = new Node(3);
root.left.left = new Node(4);
root.left.right = new Node(5);
root.right.right = new Node(8);
root.right.right.left = new Node(6);
root.right.right.right = new Node(7);
console.log("Maximum width of the binary tree:", maxWidth(root));
OutputMaximum width of the binary tree: 3
Using Breadth-First Search
This is a simple approach to calculate the maximum width of a binary tree. We traverse the tree using the breadth-first search technique. We store the maximum width at each level and update it if a greater width is found than previously stored. This way the maximum width of the binary tree is returned. Declare a maximum variable that will store the maximum width of the binary tree and update the value of a maximum variable as traversing each level of the binary tree is done using the BFS technique and in the last return the maximum width of the Binary tree is stored in a maximum variable.
Example: In the given below example BFS at each level is performed and the maximum width of the binary tree is updated at each level. After the traversal of the binary tree is completed the maximum width of the binary tree is returned.
JavaScript
class Node {
constructor(key) {
this.data = key;
this.left = null;
this.right = null;
}
}
function maxWidth(root) {
if (root === null) return 0;
let max = 0;
let levelNodes = [root];
while (levelNodes.length) {
let count = levelNodes.length;
max = Math.max(max, count);
let nextLevelNodes = [];
for (let i = 0; i < count; i++) {
let node = levelNodes[i];
if (node.left) {
nextLevelNodes.push(node.left);
}
if (node.right) {
nextLevelNodes.push(node.right);
}
}
levelNodes = nextLevelNodes;
}
return max;
}
// Constructing a sample binary tree
let root = new Node(1);
root.left = new Node(2);
root.right = new Node(3);
root.left.left = new Node(4);
root.left.right = new Node(5);
root.right.right = new Node(8);
root.right.right.left = new Node(6);
root.right.right.right = new Node(7);
console.log("Maximum width of the binary tree:", maxWidth(root));
OutputMaximum width of the binary tree: 3
Similar Reads
Non-linear Components In electrical circuits, Non-linear Components are electronic devices that need an external power source to operate actively. Non-Linear Components are those that are changed with respect to the voltage and current. Elements that do not follow ohm's law are called Non-linear Components. Non-linear Co
11 min read
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.JavaScript on Client Side: On the client side, Jav
11 min read
Web Development Web development is the process of creating, building, and maintaining websites and web applications. It involves everything from web design to programming and database management. Web development is generally divided into three core areas: Frontend Development, Backend Development, and Full Stack De
5 min read
Spring Boot Tutorial Spring Boot is a Java framework that makes it easier to create and run Java applications. It simplifies the configuration and setup process, allowing developers to focus more on writing code for their applications. This Spring Boot Tutorial is a comprehensive guide that covers both basic and advance
10 min read
Class Diagram | Unified Modeling Language (UML) A UML class diagram is a visual tool that represents the structure of a system by showing its classes, attributes, methods, and the relationships between them. It helps everyone involved in a projectâlike developers and designersâunderstand how the system is organized and how its components interact
12 min read
React Interview Questions and Answers React is an efficient, flexible, and open-source JavaScript library that allows developers to create simple, fast, and scalable web applications. Jordan Walke, a software engineer who was working for Facebook, created React. Developers with a JavaScript background can easily develop web applications
15+ min read
Steady State Response In this article, we are going to discuss the steady-state response. We will see what is steady state response in Time domain analysis. We will then discuss some of the standard test signals used in finding the response of a response. We also discuss the first-order response for different signals. We
9 min read
JavaScript Interview Questions and Answers JavaScript (JS) is the most popular lightweight, scripting, and interpreted programming language. JavaScript is well-known as a scripting language for web pages, mobile apps, web servers, and many other platforms. Both front-end and back-end developers need to have a strong command of JavaScript, as
15+ min read
React Tutorial React is a JavaScript Library known for front-end development (or user interface). It is popular due to its component-based architecture, Single Page Applications (SPAs), and Virtual DOM for building web applications that are fast, efficient, and scalable.Applications are built using reusable compon
8 min read
Backpropagation in Neural Network Back Propagation is also known as "Backward Propagation of Errors" is a method used to train neural network . Its goal is to reduce the difference between the modelâs predicted output and the actual output by adjusting the weights and biases in the network.It works iteratively to adjust weights and
9 min read