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; 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.//////////////////15/ \43/8712/ \492 4// Expected Output -> [ 5, 4, 1, 8, 2 ]

There are a few errors in the provided code. They are mentioned as follows: The stack variable is…

Answered: javascript only: debugg the following…

Engineering

Computer Science

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

See similar textbooks

Similar questions

Graphs: Depth First Traversal Starting with the same graph program as last assignment, implement a depth first traversal method. Test iy on nodes 1, 2, and 3 as start nodes. Graph program: #include <iostream>#include <vector>#include <string>using namespace std; class Edge;//-------------------------------------------------------------////class Node{public:Node(string iname){name = iname;}string name;int in_count = 0;bool visited = false; vector<Edge *> out_edge_list;};//-------------------------------------------------------------////class Edge{public:Edge(string iname, double iweight, Node *ifrom, Node *ito){name = iname;weight = iweight;from = ifrom;to = ito;} string name;double weight;Node *from;Node *to;bool visited = false;}; //-------------------------------------------------------------////class Graph{public:vector<Node *> node_list;vector<Edge *> edge_list; //----------------------------------------------------------//Node*…
Computer Science QuestionConsider the adjacency list (list of neighbors) data structure for representing a graph. struct node{int data; node * next;};class Graph { …………private:node neighborList[30];int last;};Write a method to print the neighbors of a given node n, void Graph::print(int n){??????}
creating tree containers: one that uses a vector to hold your trees (class VectorContainer). Each of these container classes should be able to hold any amount of different expressions each of which can be of any size.see example CODE GIVEN class Container {protected:Sort* sort_function; public:/* Constructors */Container() : sort_function(nullptr) { };Container(Sort* function) : sort_function(function) { }; /* Non Virtual Functions */void set_sort_function(Sort* sort_function); // set the type of sorting algorithm /* Pure Virtual Functions */// push the top pointer of the tree into containervirtual void add_element(Base* element) = 0;// iterate through trees and output the expressions (use stringify())virtual void print() = 0;// calls on the previously set sorting-algorithm. Checks if sort_function is not null, throw exception if otherwisevirtual void sort() = 0; /* Essentially the only functions needed to sort *///switch tree locationsvirtual void swap(int i, int j) = 0;// get top ptr…
creating tree containers: one that uses a vector to hold your trees (class VectorContainer). Each of these container classes should be able to hold any amount of different expressions each of which can be of any size.see example CODE GIVEN class Container {protected:Sort* sort_function; public:/* Constructors */Container() : sort_function(nullptr) { };Container(Sort* function) : sort_function(function) { }; /* Non Virtual Functions */void set_sort_function(Sort* sort_function); // set the type of sorting algorithm /* Pure Virtual Functions */// push the top pointer of the tree into containervirtual void add_element(Base* element) = 0;// iterate through trees and output the expressions (use stringify())virtual void print() = 0;// calls on the previously set sorting-algorithm. Checks if sort_function is not null, throw exception if otherwisevirtual void sort() = 0; /* Essentially the only functions needed to sort *///switch tree locationsvirtual void swap(int i, int j) = 0;// get top ptr…
using namespace std; class SinglyLinkedListNode { // INSERT YOUR CODE HERE }; class SinglyLinkedList { public: SinglyLinkedListNode *head; SinglyLinkedListNode *tail; SinglyLinkedList() { this->head = nullptr; this->tail = nullptr; } voidinsert_node(intnode_data) { // INSERT YOUR CODE HERE } }; void free_singly_linked_list(SinglyLinkedListNode* node) { // INSERT YOUR CODE HERE } // Complete the has_cycle function below. /* * For your reference: * * SinglyLinkedListNode { * int data; * SinglyLinkedListNode* next; * }; * */ bool has_cycle(SinglyLinkedListNode* head) { SinglyLinkedListNode* temp = head; bool isCycle = false; while (temp != nullptr) { // INSERT YOUR CODE HERE } } int main() { // INSERT YOUR CODE HERE TO TEST YOUR CODE return0; }
C++ PROGRAMMING Please implement these 2 methods for the node where: •int get_depth(): Returns the depth of the node. •int get_height(): Returns the height of the node. Initial code to be completed: Note: Do not add new member variables for the depth and height. struct node { node* parent; node* right; node* left; int element; int get_depth() { return 0; } int get_height() { return 0; }};
Course: Data Structure and Algorithims Language: Java Kindly make the program in 2 hours. Task is well explained. You have to make the proogram properly in Java: Restriction: Prototype cannot be change you have to make program by using given prototype. TAsk: Create a class Node having two data members int data; Node next; Write the parametrized constructor of the class Node which contain one parameter int value assign this value to data and assign next to null Create class LinkList having one data members of type Node. Node head Write the following function in the LinkList class publicvoidinsertAtLast(int data);//this function add node at the end of the list publicvoid insertAthead(int data);//this function add node at the head of the list publicvoid deleteNode(int key);//this function find a node containing "key" and delete it publicvoid printLinkList();//this function print all the values in the Linklist public LinkListmergeList(LinkList l1,LinkList l2);// this function…
C++ DATA STRUCTURES Implement the TNode and Tree classes. The TNode class will include a data item name of type string,which will represent a person’s name. Yes, you got it right, we are going to implement a family tree!Please note that this is not a Binary Tree. Write the methods for inserting nodes into the tree,searching for a node in the tree, and performing pre-order and post-order traversals.The insert method should take two strings as input. The second string will be added as a child node tothe parent node represented by the first string. Hint: The TNode class will need to have two TNode pointers in addition to the name data member:TNode *sibling will point to the next sibling of this node, and TNode *child will represent the first child ofthis node. You see two linked lists here??? Yes! You’ll need to use the linked lists
Computer Science JAVA Write a program that maintains the names of your friends and relatives and thus serves as a friends list. You should be able to enter, delete, modify, or search this data. You should assume that the names are unique. use a class to represent the names in the friends list and another class to represent the friends list itself. This class should contain a Binary Search Tree of names as a data field. (TreeNode Class BinarySearchTree Class FriendsList Class)
Assume the tree node structure is following........ struct node { int data; struct node* left; struct node* right; }; struct node *root = null; and there is a created new node function, called newnode(int new_data). Please filled the Blank of Insertion function. void insert(struct node *root, int key) { struct node *current; queue q; q.enque(root); while(!q.empty() } current = q.front(); q.deque(); if(current->left == NULL) { break; } else } q.enque( if(current->right == NULL) { break; else q.enque(_ = newnode(key); = newnode(key); _-));
write search function for this coded class TreeNode {private: int data; TreeNode* left; TreeNode* right; public: TreeNode(); TreeNode(int); //getters and setters void setData(int); void setLeft(TreeNode*); void setRight(TreeNode*); int getData(); TreeNode* getLeft(); TreeNode* getRight();}; #include"Node.h"class BST {private: TreeNode* root; public: BST(); void insert(int); bool isEmpty(); void search(int); TreeNode* findPlace(int);}; #include"BST.h"#include<iostream>using namespace std; TreeNode::TreeNode() { data = -1; left = NULL; right = NULL;}TreeNode::TreeNode(int data) { this->data = data;}void TreeNode::setData(int data) { this->data = data;}void TreeNode::setLeft(TreeNode* left) { this->left = left;}void TreeNode::setRight(TreeNode* right) { this->right = right;} int TreeNode::getData() { return data;}TreeNode* TreeNode::getLeft() { return…
c++ programming Complete all these 2 methods for the node Node methods •int get_depth(): Returns the depth of the node. •int get_height(): Returns the height of the node. Initial code to be completed:struct node { node* parent; node* right; node* left; int element; int get_depth() { return 0; } int get_height() { return 0; }};