Write a program that gets all the nodes at a relative height. public List getNodesAtHeight(Node root, int height) { List nodes = new ArrayList<> (); getNodesAtHeight(root, 0, height, nodes); return nodes; { } private void getNodesAtHeight(Node node, int currentHeight, int targetHeight, List nodes) //todo }

Write a program that gets all the nodes at a relative height. public List getNodesAtHeight(Node root, int height) { List nodes = new ArrayList<> (); getNodesAtHeight(root, 0, height, nodes); return nodes; { } private void getNodesAtHeight(Node node, int currentHeight, int targetHeight, List nodes) //todo }

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter9: Advanced Array Concepts

Section: Chapter Questions

Problem 18RQ

See similar textbooks

Similar questions

public class CustomLinkedList { public static int findMax(IntNode headObj) { /* Type your code here */ } public static void main(String[] args) { IntNode headObj; IntNode currObj; IntNode lastObj; int i; int max; // Create head node headObj = new IntNode(-1); lastObj = headObj; // Add nodes to the list for (i = 0; i < 20; ++i) { currObj = new IntNode(i); lastObj.insertAfter(currObj); lastObj = currObj; } max = findMax(headObj); System.out.println(max); }}
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; }
Given the interface of the Linked-List struct Node{ int data; Node* next = nullptr; }; class LinkedList{ private: Node* head; Node* tail; public: display_at(int pos) const; ... }; Write a definition for a method display_at. The method takes as a parameter integer that indicates the node's position which data you need to display. Example: list: 5 -> 8 -> 3 -> 10 display_at(1); // will display 5 display_at(4); // will display 10 void LinkedList::display_at(int pos) const{ // your code will go here }
public class ShoppingListDriver{ public static void main(String[] args){ ShoppingList sl=new ShoppingList(3);sl.insert(null);sl.insert(new Item("Bread", "Carb Food", 2, 2.99));sl.insert(new Item("Seafood","Sea Food", -1, 10.99));sl.insert(new Item("Rice", "Carb Food",2, 19.99));sl.insert(new Item("Salad Dressings","Dessing", 2, 19.99));sl.insert(new Item("Eggs", "Protein",2, 3.99));sl.insert(new Item("Cheese","Protein", 2, 1.59));sl.insert(new Item("Eggs", "Protein",3, 3.99));sl.printNames();sl.print(); System.out.println("After removing Eggs:");sl.remove(new Item("Eggs","Protein",0,0));sl.printNames();sl.print(); }}
void listEmployees (void) { for (int i=0; i 10000. Make a guess about why the comparison function takes 2 struct Employee parameters (as opposed to struct Employee *) **
Using a doubly linked list class and node class, implement the following methods: Node* lastNode(void); void pushBack(string argData); void popBack(void); void pushFront(string argData); void print(void); void printReverse(void); void insertAfter(Node* argPtr); void deallocateAll(void); Node* searchFor(string argData); int size(void); Hard code a linked list (no UI) in the main to demonstrate your functions. Print forward and backward to show that the links are well-formed.
//main.cpp #include "linkedListType.h"int main(){Node* head = NULL;orderedLinkedList oll = orderedLinkedList(head); oll.insert(40);oll.insert(100);oll.insert(50); oll.printList(); oll.insert(50);oll.printList(); return 0;} //linkedListType.h #include <stdio.h>#include <iostream>using namespace std; class Node{public:int data;Node* next;}; class orderedLinkedList {Node* head; public:orderedLinkedList(Node* h) {head = h;} void insert(int new_data){Node* head_ref = head; while (head_ref != NULL && (head_ref->next != NULL) && (head_ref->next)->data < new_data){cout << head_ref->data << "\n";head_ref = head_ref->next;} if (head_ref != NULL && (head_ref->next != NULL) && (head_ref->next)->data == new_data){cout << "ERROR: Item to be inserted is already in the list\n";return;} /* Insert new node */Node* new_node = new Node();new_node->data = new_data;if (head_ref != NULL) {new_node->next =…
package Linked_List; public class RefUnsortedList<T> implements ListInterface<T> {protected int numElements; // number of elements in this listprotected LLNode<T> currentPos; // current position for iteration// set by find methodprotected boolean found; // true if element found, else falseprotected LLNode<T> location; // node containing element, if foundprotected LLNode<T> previous; // node preceeding locationprotected LLNode<T> list; // first node on the listpublic RefUnsortedList(){numElements = 0;list = null;currentPos = null;}public void add(T element)// Adds element to this list.{LLNode<T> newNode = new LLNode<T>(element);newNode.setLink(list);list = newNode;numElements++;}protected void find(T target)// Searches list for an occurence of an element e such that// e.equals(target). If successful, sets instance variables// found to true, location to node containing e, and previous// to the node that links to location. If not successful,…
package Linked_List; public class RefUnsortedList<T> implements ListInterface<T>{protected int numElements; // number of elements in this listprotected LLNode<T> currentPos; // current position for iteration// set by find methodprotected boolean found; // true if element found, else falseprotected LLNode<T> location; // node containing element, if foundprotected LLNode<T> previous; // node preceeding locationprotected LLNode<T> list; // first node on the listpublic RefUnsortedList(){numElements = 0;list = null;currentPos = null;}public void add(T element)// Adds element to this list.{LLNode<T> newNode = new LLNode<T>(element);newNode.setLink(list);list = newNode;numElements++;}protected void find(T target)// Searches list for an occurence of an element e such that// e.equals(target). If successful, sets instance variables// found to true, location to node containing e, and previous// to the node that links to location. If not successful,…
Computer Science create a method +addToList(o:E):void that adds the object (o) to the ArrayList referenced by the instance variable list. create a method +removeFromBackOfList():E that removes the object at the back of the ArrayList and returns it.
Given the following definition for a LinkedList: // LinkedList.h class LinkedList { public: LinkedList(); // TODO: Implement me void printEveryOther() const; private: struct Node { int data; Node* next; }; Node * head; }; // LinkedList.cpp #include "LinkedList.h" LinkedList::LinkedList() { head = nullptr; } Implement the function printEveryOther, which prints every other data value (i.e. those at the odd indices assuming 0-based indexing).
void traverse (Node node) { if(node.left!=null){ traverse (node.left); System.out.print (node.data+" ->"); } if (node.right!=null){ System.out.print (node.data+" ->"); traverse (node.right); Write the output that will be obtained when this traverse() method is called with the root of the tree given below. 8 4 12 2 6 10 14 1 3) 7 11 13 15