n00b

one more thing about doubly linked lists. i've written a program that allows you to add new nodes to either beginning or end of the list. if i call the function for adding a node to the beginning of the list, memory can't be read as it says. however, if i add a node to the end of the list first, and THEN to the beginning, everything works just fine.
why is that?

Jimbo

Explain what you mean by "memory can't be read as it says." And do you check for an empty list when you add new nodes?

__________________
<insert disclaimer here>
<insert shameless plug for Visual Studio here>

Eric the Red

I was going to create a new thread for this. However, since we're on the topic of linked lists. When would you use a doubly linked list? I'm asking because I can see the point of having a single linked list. For instance, lets say you have a list of integers: You pass the integer to the head node and the head note will pass the integer to the next internal node. In effect, you're able to sort all the integers by doing this. Basically, "if the value is bigger than me let the next node deal with it. However, if the value is less than me then store it's address. " Well, that's a single linked lists. So why on earth would you want a second instance variable that stores the address of the last node?

Can someone please give me an example of when you would need the adress of the node behind the current node (e.g: doubly linked list) ?
[/Off Topic]

__________________
Death smiles at us all. All a man can do is smile back.

DaWei

This is a nice idea to incorporate into a linked-list class, but it is not a function of a linked list, per se.

The purpose of a doubly-linked list is that you can move back and forth, instead of always having to track from the root. For instance, if you want to insert a node before the current node, you need to have the address of the previous node, so you can rechain. You can write code to keep the previous as you track through the list, but it's less trouble to just have it available.

__________________
Abstraction doesn't make it impossible to write bad code; it makes it possible to write superior code.
Contributor's Corner: Grumpy on C++ Exceptions DaWei on Pointers

bl00dninja

how do you eat a reese's?

same thing with trees.

what type of binary tree?...binary search tree, max-heap, min-heap...etc.

YOU define the criteria, don't ask me "guess how i put my pants on today"?

i don't fucking know. if you said "left leg first, then right", i might be able to help.

same shit with trees. insertion, deletion, and traversal operations may have different properties depending on your tree.

__________________
i put on my robe and wizard hat...

Have you ever heard of Plato, Aristotle, Socrates?...Morons.