Consider the following struct declaration that defines a node of a linked link.  struct Node{  char ch;  struct Node* link;  };  Consider the linked list in Figure 1. Suppose head and temp are Node type pointers. The head node of the linked list is pointed by the head pointer. Each node stores one character type data as shown in Figure 1. What will be the output of the following pseudocode?  foo(head)  1.if head is NULL a. return  2. temp = head  3. foo(temp->link)  4. print temp->ch

New Perspectives on HTML5, CSS3, and JavaScript
6th Edition
ISBN:9781305503922
Author:Patrick M. Carey
Publisher:Patrick M. Carey
Chapter12: Working With Document Nodes And Style Sheets: Creating A Dynamic Document Outline
Section12.2: Visual Overview: Exploring Attribute Nodes
Problem 2QC
icon
Related questions
Question

Consider the following struct declaration that defines a node of a linked link. 

struct Node{ 

char ch; 

struct Node* link; 

}; 

Consider the linked list in Figure 1. Suppose head and temp are Node type pointers. The head node of the linked list is pointed by the head pointer. Each node stores one character type data as shown in Figure 1. What will be the output of the following pseudocode? 

foo(head) 

1.if head is NULL a. return 

2. temp = head 

3. foo(temp->link) 

4. print temp->ch 

head
A
R
Figure 1: linked list for question 2
Transcribed Image Text:head A R Figure 1: linked list for question 2
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Linked List Representation
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.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
New Perspectives on HTML5, CSS3, and JavaScript
New Perspectives on HTML5, CSS3, and JavaScript
Computer Science
ISBN:
9781305503922
Author:
Patrick M. Carey
Publisher:
Cengage Learning