Help on Linked List Search

Hello guys..

i'm stuck (on this problem) while doing revision questions for exam next week. I just understand this question.

Can you please make it understandable and guidance (on how to do it) if possible??

Quote:

---

5 a) Write a C++ function called searchString that is passed as a null terminated string called inString and a link-list of strings called head. This function searches and returns a boolean value true if inString exists in the linked structure. Otherwise a boolean value false is returned. Assume that each linked list node has the following structure:

Code:

---

struct Node
{
  char directive[10];
  Node *next;
  };
    typedef Node * LNode; 
               
bool searchString(LNode &head, char *inString)

---

---

do i have to initialize a link list for this??

hopefully this makes things a little clearer.

Code:

---

struct Node
{
  Node(Node* nextNode=0):
    next(nextNode)
  {
  }
  char directive[10];
  Node *next;
};

void traverseList(Node& node)
{
  if(node.next)
  {
    traverseList(*node.next);
  }
}


int _tmain(int argc, _TCHAR* argv[])
{
  Node n3, n2(&n3), n1(&n2), n0(&n1);
  traverseList(n0);
 
  return 0;
}

---

thanks sir..

what is a null terminated string and how does it work with the linked list?? (just so that i can understand the question even more)

when you type in a string literal, e.g. "abcd", the compiler interprets this as an array of 5 chars. [97,98,99,100,0] (97 - 100 are the ascii codes for a-d, respectively) the 0 on the end is the "null character", that tells various string-processing functions that a char* string has ended.

in your problem, i assume that directive is a string of at most 9 printing characters (with a terminating null byte on the end)

still not sure in this :(

just don't know where to start.. can't find any help from www also..

i showed one possible way to traverse the list. do you understand how to compare strings?

no.. :(

there are standard functions to do just that, but it really isn't that complicated.

a string is an array of characters.

if each value in two arrays are equal, then the two arrays contain the same word (or phrase), and so the strings are equal to each other.

at this point, why don't you go ahead and do some coding and post your attempt (make sure it at least compiles).

Quote:

---

Originally Posted by sivapc

no.. :(

---

Let me google that for you