Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • Home
  • SEARCH
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8708957
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 13, 20262026-06-13T04:15:08+00:00 2026-06-13T04:15:08+00:00

Here is my data structure struct Node{ int x; Node *next; Node *prev; }

  • 0

Here is my data structure

struct Node{
      int x;
      Node *next;
      Node *prev;
}

If I allocate memory

Node *A = malloc (sizeof (Node) * 10);

How can I access each box in the array using array index in this case? or it’s not possible?

My goal just want to make a linked list in this chunk of memory.

basically i want to assign a block of memory and then assign their prev and next….

maybe it’s confusing , sorry about my wording..

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-13T04:15:09+00:00Added an answer on June 13, 2026 at 4:15 am

    This gives you an array of 10 Nodes, accessible through A. Now, all you have to do is e.g.

    A[0].next = &A[1];
    

    to set the next value of the first node.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have a Code example here. struct node { int data; struct node *link;
Here is my MESSAGE structure: struct tEventMessage { // Type of the event int
Here is my data structure alt text http://luvboy.co.cc/images/db.JPG when i try this sql select
Is there a .NET data structure I could use for bidirectional lookup? Here's the
I have a problem here that requires to design a data structure that takes
Here is a table structure (e.g. test): Field Name Data Type id BIGINT (20)
Here is a simplified version of a consider the data structure below in Matlab:
In ASP.NET C# I have a struct: public struct Data { public int item1;
I have an application that deals with data in the following structure: struct Message
Here is design of my graph data structure which i've developed from scratch. Now

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.