Inserting Nodes After Q: Let's Double Check!

  • Context: MHB 
  • Thread starter Thread starter evinda
  • Start date Start date
  • Tags Tags
    Nodes
Click For Summary
SUMMARY

The discussion focuses on the process of inserting a node pointed to by P immediately after a node pointed to by Q in a linked list. The correct notation for simultaneous assignment is clarified, indicating that the use of the symbol $\leftarrow$ signifies that multiple assignments can occur simultaneously without a specific order. It is emphasized that in actual programming languages like C, the order of assignments matters, specifically changing Q->next->prev before Q->next is necessary to maintain list integrity.

PREREQUISITES
  • Understanding of linked list data structures
  • Familiarity with pointer manipulation in programming languages
  • Knowledge of simultaneous assignment notation
  • Basic programming skills in C or similar languages
NEXT STEPS
  • Study linked list insertion algorithms in C
  • Learn about pointer arithmetic and manipulation
  • Explore simultaneous assignment in algorithm design
  • Review common pitfalls in linked list operations
USEFUL FOR

Software developers, computer science students, and anyone interested in data structure manipulation and algorithm design will benefit from this discussion.

evinda
Gold Member
MHB
Messages
3,741
Reaction score
0
Hi! (Smirk)

According to my notes, if we want to insert a node pointed to by P just after node poited to by Q, we have to do the following changements:

$$\begin{pmatrix}
P->prev\\
P->next\\
Q->next\\
Q->next->prev
\end{pmatrix} \leftarrow
\begin{pmatrix}
Q\\
Q->next\\
P\\
P
\end{pmatrix}$$

Shouldn't it be $\rightarrow$ ? :confused:

Also, shouldn't we first change [m]Q->next->prev[/m] and then [m]Q->next[/m]?

Or am I wrong? (Worried)
 
Technology news on Phys.org
evinda said:
Hi! (Smirk)

According to my notes, if we want to insert a node pointed to by P just after node poited to by Q, we have to do the following changements:

$$\begin{pmatrix}
P->prev\\
P->next\\
Q->next\\
Q->next->prev
\end{pmatrix} \leftarrow
\begin{pmatrix}
Q\\
Q->next\\
P\\
P
\end{pmatrix}$$

Shouldn't it be $\rightarrow$ ? :confused:

Also, shouldn't we first change [m]Q->next->prev[/m] and then [m]Q->next[/m]?

Or am I wrong? (Worried)

Hey! (Wave)

The symbol $\leftarrow$ means simultaneous assignment.
It means that we do for instance: [m]P->prev = Q;[/m]. (Smirk)

Since the assignment is simultaneous, the order is not relevant.
You may interpret it as if the right hand values are first copied to 4 temporary variables, and then those 4 temporary variables are copied to the left hand variables. (Nerd)
 
I like Serena said:
Hey! (Wave)

The symbol $\leftarrow$ means simultaneous assignment.
It means that we do for instance: [m]P->prev = Q;[/m]. (Smirk)

Since the assignment is simultaneous, the order is not relevant.
You may interpret it as if the right hand values are first copied to 4 temporary variables, and then those 4 temporary variables are copied to the left hand variables. (Nerd)

A ok... (Nod) But, when we write an algorithm, we have to change firstly [m]Q->next->prev[/m] and then [m]Q->next[/m], right? (Thinking)
 
evinda said:
A ok... (Nod) But, when we write an algorithm, we have to change firstly [m]Q->next->prev[/m] and then [m]Q->next[/m], right? (Thinking)

That is only necessary when you write in an actual programming language like C.
In an "algorithm" you can use this notation for simultaneous assignment. (Nod)
 
I like Serena said:
That is only necessary when you write in an actual programming language like C.
In an "algorithm" you can use this notation for simultaneous assignment. (Nod)

I understand... Thank you! (Smile)
 

Similar threads

  • · Replies 6 ·
Replies
6
Views
3K
Replies
15
Views
5K
Replies
1
Views
2K
  • · Replies 5 ·
Replies
5
Views
1K
  • · Replies 0 ·
Replies
0
Views
2K
  • · Replies 6 ·
Replies
6
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 0 ·
Replies
0
Views
6K
  • · Replies 11 ·
Replies
11
Views
3K