javascript only: debugg the following code to pass specs.
Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
Related questions
Question
javascript only: debugg the following code to pass specs.
![function findFirstNodes (root) {
let stack(queue) = [root];
//root. level = 0;
const firsts = [];
}
while (stack.length != 0) {
const curr = stack.pop();
}
if (!firsts [curr.level]) {
| | firsts.push(curr.value);
}
if (curr.left) {
}
stack.shift(curr.left);
return firsts;](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb4cf1a6f-9d71-4dba-b9eb-431226f95cce%2F61318a6b-61a0-42e6-b8f5-490df0a1ace6%2Fronpmwp_processed.png&w=3840&q=75)
Transcribed Image Text:function findFirstNodes (root) {
let stack(queue) = [root];
//root. level = 0;
const firsts = [];
}
while (stack.length != 0) {
const curr = stack.pop();
}
if (!firsts [curr.level]) {
| | firsts.push(curr.value);
}
if (curr.left) {
}
stack.shift(curr.left);
return firsts;
![class TreeNode {
constructor(value, left, right, level) {
}
}
this.value = value;
this. left = left;
this.right = right;
this.level = level
// Given a tree, find the first (left-most) node at each
// level of the tree and return it in an array, with the root at the
// 0th index, and the left-most node in the deepest level of the tree
// in the last index.
//
//
//
//
//
//
//
//
//
1
5
/ \
4
3
/
8
7
1
2
/ \
4
9
2 4
// Expected Output -> [ 5, 4, 1, 8, 2 ]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fb4cf1a6f-9d71-4dba-b9eb-431226f95cce%2F61318a6b-61a0-42e6-b8f5-490df0a1ace6%2F73ekqt_processed.png&w=3840&q=75)
Transcribed Image Text:class TreeNode {
constructor(value, left, right, level) {
}
}
this.value = value;
this. left = left;
this.right = right;
this.level = level
// Given a tree, find the first (left-most) node at each
// level of the tree and return it in an array, with the root at the
// 0th index, and the left-most node in the deepest level of the tree
// in the last index.
//
//
//
//
//
//
//
//
//
1
5
/ \
4
3
/
8
7
1
2
/ \
4
9
2 4
// Expected Output -> [ 5, 4, 1, 8, 2 ]
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
This is a popular solution!
Trending now
This is a popular solution!
Step by step
Solved in 2 steps with 2 images

Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Recommended textbooks for you

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education

Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON

Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON

C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON

Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning

Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education