Styjun

Removing files under particular conditions (number of files, file age)

Electoral considerations aside, what are potential benefits, for the US, of policy changes proposed by the tweet recognizing Golan annexation?

Non-trope happy ending?

Why is so much work done on numerical verification of the Riemann Hypothesis?

Freedom of speech and where it applies

What is the evidence for the "tyranny of the majority problem" in a direct democracy context?

Does a 'pending' US visa application constitute a denial?

How do I color the graph in datavisualization?

Intuition of generalized eigenvector.

How to explain what's wrong with this application of the chain rule?

What is Cash Advance APR?

How to bake one texture for one mesh with multiple textures blender 2.8

Is there a working SACD iso player for Ubuntu?

Longest common substring in linear time

Loading commands from file

Does an advisor owe his/her student anything? Will an advisor keep a PhD student only out of pity?

What is this called? Old film camera viewer?

How do you respond to a colleague from another team when they're wrongly expecting that you'll help them?

On a tidally locked planet, would time be quantized?

How much character growth crosses the line into breaking the character

What if a revenant (monster) gains fire resistance?

Strong empirical falsification of quantum mechanics based on vacuum energy density

If a character has darkvision, can they see through an area of nonmagical darkness filled with lightly obscuring gas?

When were female captains banned from Starfleet?

Stack List -> Circular List

How do I check if a list is empty?What and where are the stack and heap?Finding the index of an item given a list containing it in PythonDifference between append vs. extend list methods in PythonHow do you split a list into evenly sized chunks?Getting the last element of a list in PythonHow to make a flat list out of list of lists?How do I get the number of elements in a list in Python?How do I concatenate two lists in Python?How to clone or copy a list?

0

I create an Stack List in C, with StackElement, Stack, Constructor, Destructor, etc.

Now i want to connect the first list node with the header node. (circular list)
How can I do this?

My first Code was:

int circle(struct stack *stack) {
 struct stackNode *Node;

 Node = stack->top;

if (!Node) 
 return 0;


while (Node) 
 Node = Node->next;
 FirstElement = Node;
 if (FirstElement == NULL)
 break;

FirstElement = Node;
FirstElement->next = stack->top;

cout << Node << " to " << FirstElement << endl;

But this code doesnt work..

c list stack adt

share|improve this question

asked 2 days ago

Mr. ManPowerMr. ManPower

6

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  This appears to be C++, not C. Also, in what ways does the code not work? Does it not compile? If it runs, what do you expect to see, and what do you actually see?
  
  – Thomas Jager
  2 days ago
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  Nope, I must to this only with C. I can compile this Code. But I have not an circular Stack list. I want to connect the First Element(next-Address = NULL) with the Last Element..
  
  – Mr. ManPower
  2 days ago
  
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  @Mr.ManPower The cout implies you are using c++
  
  – mjcs
  2 days ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  @Mr.ManPower Using cout and endl, as well as using the << in that way are generally C++ things. If this is being compiled as C code, it will fail to compile.
  
  – Thomas Jager
  2 days ago
  
  

  
  
  
  


• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  
  @Mr.ManPower If cout and endl work, this is not C.
  
  – Thomas Jager
  2 days ago
  

  
  
  
  

 | 
show 4 more comments

0

I create an Stack List in C, with StackElement, Stack, Constructor, Destructor, etc.

Now i want to connect the first list node with the header node. (circular list)
How can I do this?

My first Code was:

int circle(struct stack *stack) {
 struct stackNode *Node;

 Node = stack->top;

if (!Node) 
 return 0;


while (Node) 
 Node = Node->next;
 FirstElement = Node;
 if (FirstElement == NULL)
 break;

FirstElement = Node;
FirstElement->next = stack->top;

cout << Node << " to " << FirstElement << endl;

But this code doesnt work..

c list stack adt

share|improve this question

asked 2 days ago

Mr. ManPowerMr. ManPower

6

• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  This appears to be C++, not C. Also, in what ways does the code not work? Does it not compile? If it runs, what do you expect to see, and what do you actually see?
  
  – Thomas Jager
  2 days ago
  
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  Nope, I must to this only with C. I can compile this Code. But I have not an circular Stack list. I want to connect the First Element(next-Address = NULL) with the Last Element..
  
  – Mr. ManPower
  2 days ago
  
  

  
  
  
  


• 
  
  
  

  
  1
  

  
  
  
  
  
  

  
  
  @Mr.ManPower The cout implies you are using c++
  
  – mjcs
  2 days ago
  

  
  
  
  


• 
  
  
  

  
  

  
  
  
  
  
  

  
  
  @Mr.ManPower Using cout and endl, as well as using the << in that way are generally C++ things. If this is being compiled as C code, it will fail to compile.
  
  – Thomas Jager
  2 days ago
  
  

  
  
  
  


• 
  
  
  

  
  2
  

  
  
  
  
  
  

  
  
  @Mr.ManPower If cout and endl work, this is not C.
  
  – Thomas Jager
  2 days ago
  

  
  
  
  

 | 
show 4 more comments

I create an Stack List in C, with StackElement, Stack, Constructor, Destructor, etc.

Now i want to connect the first list node with the header node. (circular list)
How can I do this?

My first Code was:

int circle(struct stack *stack) {
 struct stackNode *Node;

 Node = stack->top;

if (!Node) 
 return 0;


while (Node) 
 Node = Node->next;
 FirstElement = Node;
 if (FirstElement == NULL)
 break;

FirstElement = Node;
FirstElement->next = stack->top;

cout << Node << " to " << FirstElement << endl;

But this code doesnt work..

c list stack adt

share|improve this question

asked 2 days ago

Mr. ManPowerMr. ManPower

6

int circle(struct stack *stack) {
 struct stackNode *Node;

 Node = stack->top;

if (!Node) 
 return 0;


while (Node) 
 Node = Node->next;
 FirstElement = Node;
 if (FirstElement == NULL)
 break;

FirstElement = Node;
FirstElement->next = stack->top;

cout << Node << " to " << FirstElement << endl;

share|improve this question

asked 2 days ago

Mr. ManPowerMr. ManPower

6

share|improve this question

asked 2 days ago

Mr. ManPowerMr. ManPower

6

asked 2 days ago

Mr. ManPowerMr. ManPower

6

asked 2 days ago

Mr. ManPowerMr. ManPower

6