How to get the size of a linked list

Question

0.00/5 (No votes)

See more:

I am having trouble with link lists and recursion I was hoping someone can guide through this question:

suppose that the class LinkedBag did not have the data member item_count_. Revise the method getCurrentSize so that it counts the number of nodes in the linked chain a. iterartively b. Recursively

The original GetCurrentSize() is just

int LinkedBag<ItemType>::GetCurrentSize() const
{
  return item_count_;
}

Here is what I have so far:

C++

int GetCurrentSize(node* p)
{
        if (p==NULL)
                return 0;
        else{
             return 1 + GetCurrentSize(cur->next_node);
             }

}

C++

int GetCurrentSize(node* cur){
    int count;
    while(cur != NULL){     
        cur->next_node;
        count++
        }
return count;

}

Posted 2-Mar-15 11:15am

Member 11492720

Updated 2-Mar-15 11:41am

v5

Add a Solution

3 solutions

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Matt T Heffron · Answer 1 · 2015-03-02T11:33:00

Besides the fact that the compile has no way to know which version of GetCurrentSize you intend to use at any point, because they have the same signature. Your iterative version declares the count from within the loop, so it's value is not necessarily carried from iteration to iteration. It fails to initialize it at all. And you never actually return the value.
More like:

C++

int GetCurrentSize(node* cur){
        int count = 0;
    while(cur != NULL){
        cur->next_node;
        count++
        }
    return count;
}

BacchusBeale · Answer 2 · 2015-03-02T11:36:00

Solution 2

for recursion you first need to make the base case e.g

C#

if(cur==NULL) return 0;

then in other cases:

C#

else{
return 1 + GetCurrentSize(cur->next_node);
}

Posted 2-Mar-15 11:36am

BacchusBeale

Member 11492720 · Answer 3 · 2015-03-02T11:41:00

Solution 3

Is it correct now?

XML

<pre lang="c++">
int GetCurrentSize(node* p)
{
        if (p==NULL)
                return 0;
        else{
             return 1 + GetCurrentSize(cur-&gt;next_node);
             }

}
</pre>
<pre lang="c++">
int GetCurrentSize(node* cur){
    int count;
    while(cur != NULL){
        cur-&gt;next_node;
        count++
        }
return count;

}
</pre>

Posted 2-Mar-15 11:41am

Member 11492720

Comments

PIEBALDconsult 2-Mar-15 17:48pm

Please use Improve question to update the question, do not post it as a solution.