Question

Write a recursive function in C++ that displays all nodes data (integers) in an array of...

Write a recursive function in C++ that displays all nodes data (integers) in an array of linked lists.

Assuming:

struct node

{

int data;

node * next;

};

class arrayList

{

public:

arrayList();

~arrayList();

private:

node ** head;

int size; //(this is determined by another part of the program)

}

0 0
Add a comment Improve this question Transcribed image text
Answer #1
void display() {
        int i = 0;
        
        while(i < size) {
                cout << "List " << i << ": ";
                node *start = head[i];
                while(start != NULL) {
                        cout << start->data << " ";
                        start = start->next;
                }
                cout << endl;
                i++;
        }
}

please let me know if any issues. Thanks!

Add a comment
Know the answer?
Add Answer to:
Write a recursive function in C++ that displays all nodes data (integers) in an array of...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
  • C programming Write an iterative and recursive version of a function to print out a linked...

    C programming Write an iterative and recursive version of a function to print out a linked list from head to tail and then do the same for printing a linked list from tail to head. Assume a singly linked list in all cases and access only to a head pointer at the time of the function call. struct node; typedef struct node Node; struct node int data; Node next;

  • how can I find the sum of data that are in the list using an ARRAY...

    how can I find the sum of data that are in the list using an ARRAY of linked list . I just need a small example please. I'm not sure how to move from head[0] to head[1]....??? // This is the struct that I am working on: struct node { int data; node * next; } class List { public: list(); ~list(); private: node ** head; int size; };

  • Please write program in C language. 2.Write a recursive int function to return the number of...

    Please write program in C language. 2.Write a recursive int function to return the number of even integers in a linked list. Each node in the list has an integer number (declared as int number) and a pointer to the next node (declared as NODE *next). The function is defined as int count (NODE *); and is called as follows: x = count(head);

  • In C++ Assuming: struct node { int data; node * next; }; and copyList(node * head);...

    In C++ Assuming: struct node { int data; node * next; }; and copyList(node * head); Write a recursive function (copyList(node * head)) that will create a copy of the singly linked list.

  • C++: Write a recursive function that displays the contents of an array in reverse order (from...

    C++: Write a recursive function that displays the contents of an array in reverse order (from the bottom up). The function declaration may look something like this: void displayReverse(char list[], int size, int startingIndex); The parameters are described as follows: list: The array to be displayed. size: The number of elements in the array. startingIndex: The element of the array currently being examined by the algorithm. The call to the function from main should look something like this, assuming that...

  • 1) (10 pts) Write a recursive function that counts and returns the number of nodes in...

    1) (10 pts) Write a recursive function that counts and returns the number of nodes in a binary tree with the root root, that store an even value. Please use the struct shown and function prototype shown below. (For example, if the tree rooted at root stored 2, 3, 4, 8, 13, 18 and 20, the function should return 5, since there are five even values [2,4,8,18,20] stored in the tree. typedef struct node { int data; struct node* left;...

  • Problem 1 Given a linked list of integers, write a function getUnique that removes all duplicates elements in the linked list and returns the new linked list of unique elements (The order does not ma...

    Problem 1 Given a linked list of integers, write a function getUnique that removes all duplicates elements in the linked list and returns the new linked list of unique elements (The order does not matter). Example: Input: 1-»2->3->1-2 Output: 1->2->3 public class Node f int iterm Node next; Node(int d) t item = d; next-null; ) import java.util.ArrayList; public class ExtraLab public static void main (String[] args)t PROBLEM 1 System.out.println("PROBLEM 1"); Node head new Node(1); head.next-new Node (2); head.next.next-new Node(3);...

  • C++ Data Structures and Algorithms Binary Trees: Implementation Answer the following question(s) concerning implementing recursive functions...

    C++ Data Structures and Algorithms Binary Trees: Implementation Answer the following question(s) concerning implementing recursive functions to perform operations on linked lists of nodes arranged as binary trees. For these questions, use the following struct definition for the nodes of the tree (we will not templatize the node here, so you do not have to write template functions for these questions, just assume trees of <int>values): struct BinaryTreeNode { int item; BinaryTreeNode* left; BinaryTreeNode* right; }; Write a recursive function...

  • Project Description: In this project, you will combine the work you’ve done in previous assignments to...

    Project Description: In this project, you will combine the work you’ve done in previous assignments to create a separate chaining hash table. Overview of Separate Chaining Hash Tables The purpose of a hash table is to store and retrieve an unordered set of items. A separate chaining hash table is an array of linked lists. The hash function for this project is the modulus operator item%tablesize. This is similar to the simple array hash table from lab 5. However, the...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT