Question

Simple singly-linked list question:

write an iterative function position(p, target) that returns position (1, 2, 3, or .......) of the target in the list to which p points. If target is not on the list the function returns -1.

please write the function in C++ thanks

Answer 1

Here is code:

#include <stdio.h>

#include <stdlib.h>

struct listNode

{

struct listNode *nxt;

int val;

} * head;

/*

* ───────────────────────────────────────────── RETURNS THE NTH ELEMENT DATA ─────

*/

int position(struct listNode *p, int n)

{

if (p->val == n)

{

return n;

}

return position(p->nxt, n);

return -1;

}

/*

* ───────────────────────────────────────────────────────────── ADD THE DATA ─────

*/

void add(int num)

{

struct listNode *temp;

temp = (struct listNode *)malloc(sizeof(struct listNode));

temp->val = num;

if (head == NULL)

{

head = temp;

head->nxt = NULL;

}

else

{

temp->nxt = head;

head = temp;

}

}

int main()

{

add(1);

add(2);

add(3);

add(4);

add(5);

add(6);

add(7);

add(8);

add(9);

add(10);

int result = position(head, 5);

printf("%d",result);

}

Output:

5