How to create a linked list from a binary input file? With first few bytes being an int and the next few a char and so on

if the address of the first node of a linked list consisting of an integer and a pointer
generic linked list c++
linked list in c
generic linked list in c
linked list of structs in c
c program to create a linked list
struct node
linked list in c example program

I want to create a linked list from an input binary file. The first sizeof(int) bytes is an int and the next sizeof(char) bytes is a char and it keeps going like that. What I want to do is create a linked list from this file where each node in the linked list contains a character and a tree node that contains this int value.

I am stuck when it comes to creating a linked list out of this file. If it was just a regular file with ints and no binary and no chars, I would have used fscanf to read the file and stored its contents into an array, and then I would have traversed through the array and made the nodes. However, I am confused when these chars are present in the file. Could anyone please help me and tell me if there is a way to create a linked list?

Edits ->

ListNode *head = malloc(sizeof(ListNode)*sizeoffile);

//how do i find the size of the file.
//if it was a file with just integers, I would have done something like this
// int value;
// int count = 0;
//while(fscanf(fptr, "%d", &value)==1)
//  count++;
//But now that there is chars, I am really confused how I would determine  
//the size of the file.

  fread(head, sizeof(int)+sizeof(char), 1, fptr);

I know this is not right. ^

Step 1: Assume all data from an external source (e.g. from a file) is potentially malicious and/or corrupted and/or came from a different computer (with different sizeof(int) and different endianness).

Step 2: Define your file format properly (taking step 1 into account). E.g. maybe it's supposed to be a value in the range 123 to 123456 that's stored as 4 consecutive bytes in little endian order (it should never be an int); and maybe it's a byte containing an ASCII character (it should never be a "random whatever character set the compiler felt like using char").

Step 3: Write some code to load data from the file into an array of bytes. If the file is expected to be small you can use realloc() to increase the size of the buffer if the buffer wasn't big enough (but make sure there's a "max. file size" so that a malicious attacker can't trick you into consuming all available RAM and crashing due to "out of memory"). If the file is expected to be larger; look into functions like mmap(). Alternatively, you can have a "read next part of file; parse next part of file" loop that recycles a fixed sized buffer.

Step 4: Write code to parse the "array of bytes" data and check that it actually complies with the file format specs in every way possible. For example, unsigned long value = buffer[0] + (buffer[1] << 8) + (buffer[2] << 16) + (buffer[3] << 24) and if( (value < 123) || (value > 123456) ) { // Data is malformed.

Step 5: Once you've parsed the data (and written code to handle every conceivable error condition in an appropriate manner, and know for a fact that it must be valid data), you can store the data in a structure and add that structure to a linked list. E.g.

    // Parse and check it

    if(bufferSize < position + 5) {
        return "File ends in the middle of a record";
    unsigned long value = buffer[position] + (buffer[position+1] << 8) + (buffer[position+2] << 16) + (buffer[position+3] << 24);
    if( (value < 123) || (value > 123456) ) {
        return "Data was malformed (integer out of range)";

    if( (buffer[position+4] < 0x20) || (buffer[position+4] >= 0x7F) ) {
        return "Data was malformed (character not printable ASCII)";

    // Create a structure

    myStructureType * myStruct = malloc(sizeof(myStructureType));
    if(myStruct == NULL) {
        return "Failed to allocate memory for structure";
    myStruct->value = value;
    myStruct->character = buffer[position+4];
    position += 5;

    // Add structure to singly linked list

    myStruct->next = NULL;
    if(listFirst == NULL) {
       listFirst =  myStruct;
    } else {
       listLast->next =  myStruct;
    listLast =  myStruct;

Generic Linked List in C, How to create a linked list in C that can be used for any data type? In C, we can Also, size of all types of pointers is always is same, so we can always allocate a linked list node. Assumption: char takes 1 byte. int i;. for (i=0; i<data_size; i++) Change head pointer as new node is added at the beginning. Create new linked list from two given linked list with greater element at each node; Create a linked list from two linked lists by choosing max element at each position; Create a sorted linked list from the given Binary Tree; Create a Doubly Linked List from a Ternary Tree; Linked List vs Array; A Programmer's approach of looking at Array vs

Ok, so I suggest that you forget about linked lists. Just stick to the first problem: reading data from a binary file.

The text of the problem is unclear about the size of the objects, so let's assume that it says: "There is a binary file which contains widgets composed by a 32 bit integer (little endian) and an 8 bit number representing an ASCII character. Dump all the widgets to stdout one per line representing the integer in base 10 followed by a space and then the character".

Let's assume that your int is 32 bit little endian and your char is a signed byte, i.e. let's assume you are on one of the 99.9% of the machines in the world.

Now you have to read the widgets, that is an int and a char. There are usually two functions you have to chose from when reading: fscanf and fread. The first one reads from data formatted for humans to read, while the second one reads bytes as they are from a file. Which one do you need now? the second one, so we need to use that.

In your code you write

while (!feof(fptr))

This is always wrong. The only correct way for reading a file is:

while (1) {
    // Read
    // Check
    // Use

Then you can find a way to read and check in the while condition, but believe me: write it this way the first time.

So lets populate the above template. To check if fread succeeded you need to check if it returned the number of elements you asked for.

while (1) {
    int i;
    char c;
    // Read
    int ok1 = fread(&i, 4, 1, fptr);
    int ok2 = fread(&c, 1, 1, fptr);
    // Check
    if (ok1 != 1 || ok2 != 1)
    // Use
    printf("%d %c\n", i, c);

Of course you can pack this in the while condition, but I don't see a reason for that.

Now I'd test this with your input and with a good debugger and check if all the data in the file gets printed out. If everything is ok, you can move on to the rest of the problem, that is putting these widgets in a linked list.

Here I assumed that you didn't learn structs yet. If this is not the case, you can work with them:

struct widget {
    int i;
    char c;


while (1) {
    struct widget w;
    // Read
    int ok1 = fread(&w.i, 4, 1, fptr);
    int ok2 = fread(&w.c, 1, 1, fptr);
    // Check
    if (ok1 != 1 || ok2 != 1)
    // Use
    printf("%d %c\n", w.i, w.c);

Don't be deluded by the fact that the widget has the same structure of your data on file. You cannot trust that

fread(&w, 5, 1, fptr); // No! Don't do this

will read your data correctly. When making a struct, the compiler can put all the space it want between fields, so I wouldn't be surprised if sizeof(widget) returned 8.

Disclaimer: I wrote the code directly on the browser and didn't check it!

[PDF] Lecture 09 C Structs and Linked Lists Structs in C, operator. For example, we can define a typedef for a struct that contain two fields, var1 and var2 as: typedef struct { unsigned int var1; char* var2;. } node;. LinkedList<T>() Initializes a new instance of the LinkedList<T> class that is empty.. LinkedList<T>(IEnumerable<T>) Initializes a new instance of the LinkedList<T> class that contains elements copied from the specified IEnumerable and has sufficient capacity to accommodate the number of elements copied.

I think you are getting a little too caught up in something that isn't really a fundamental problem. if you need to create a linked list from a file, you could use fscanf() or fread() or whatever you like to read a file into a buffer and manipulate that buffer as you wish. The same logic for parsing an array of ints (read in from a file) can be applied to parsing a buffer of strings from a binary file (you say binary file with sizeof(int), sizeof(char) consecutively so I'm going to assume you mean it can be read into a buffer)

You say

"If it was just a regular file with ints and no binary and no chars, I would have used fscanf to read the file and stored its contents into an array, and then I would have traversed through the array and made the nodes"

you can traverse a string, or list of strings (however you decide to parse your buffer) using the same logic to make nodes. That's the beauty of a data structure, or struct if you will, in C.

[PDF] Node Structure */ struct node, 2. /* Node Structure */ struct node { int data; struct node *next; }. A linked list is… Each node is allocated in the heap with a call to malloc(), so the node Build the list {1, 2, 3} in the heap and store its head pointer in a local stack 9. Inserting into a link list has two cases. First in the list. Not first in the list binary = 41 char� So, you make a copy, delete the file I/O stuff and end up with two copies of the code to maintain. Then a third situation arises, so you copy the code again Whenever you write code keep an eye open for reuseability. By separating the linked list from the file I/O you have linked list capability in any program by using the original debugged code.

[PDF] crack the interview, r Write a C program to return the nth node from the end of a linked list. New! r Write C code to implement the Binary Search algorithm. r Write a program to merge two arrays in sorted order, so that if an integer is in both the arrays When the nodes being compared are not adjacent and one of them is the first node. 2. Note that I've used a static array to create the tree; you don't have to do dynamic memory management of the tree, though it is certainly more conventional to do so. The output when the code is run: Tree: 0x101df5060 11 13 17 19 101 103 107 109 109 107 101 103 17 11 13 19

Introduction to pointers, 1 struct A { 2 int L,M; 3 char C; 4 }; 5 6 struct A T,U; Here Lines 1-4 define this new type A, and Line 6 declares two variables, T and U, 17 18 initial input can be from a previously-created file if desired; 19 file is in binary format, input file and build linked list */ 74 75 { int FD, /* file descriptor */ 76 InFileSize, /* number of � I need to read and write a linked list to a binary file so that it may be kept throughout the life of the program, but I'm having a hell of a time and my sourcecode doesn't work and I can't figure it out. PLEASE HELP! main.cpp: #include "stdafx.h" #include&lt;iostream&gt; // For cin, cout //#includ

Stacks and Queues, First, in push(), we check whether there is room for the new item; if not, we A Node object has two instance variables: a String and a Node. For example, to build a linked list that contains the items "to", "be", and "or", we for each of the primitive types: Boolean, Integer, Double, Character, and so forth. Read names from .txt File and add it to a linked list I want to create a linked list, wich contains names from a input.txt File. First name and last name are seperatet by a blank space and after the last name there is a linebreak.

  • Technically the answer to your question is "yes" (there is a way to create linked lists). Why do you need to create an array first? If you can traverse an array, you can traverse an input file. Where exactly are you stuck?
  • If you want an answer, you need to really clarify this question and show some effort. Let's see, you could start editing your question and show us your code for reading one integer and one char from a binary file. Before that show us the hex dump of such a file.
  • @melpomene I want to traverse the input file and put it into a linked list. I am confused because I dont know how to use fscanf when it is a linked list. Would I use %d or %c in the parameters? I dont know how to put both things into one node. I am confused because the file is a binary file. I am sorry if I am not explaining my problem well.
  • @CostantinoGrana I edited the post to add code. The reason I didn't add code was because I didn't know how to form the code in the first place and I was confused as to how I would go about forming it. I have added some code to make my problem more clear. If you could help, that would be great, I apologize if my question wasn't clear, I am a beginner and I really don't know how to go about solving this problem.
  • This is a good comprehensive answer. @noobie, if some of this seems over your head currently (ie, things like endianness and different sizeof(int)) then you may wish to ask followup questions about this. The short story here is that you can't really reliably shove the contents of your C structure into a file and then suck them back up. There may be cases where you could do so, but you shouldn't learn it from that direction; follow @Brendan's advice here for defining a binary format for your file and then processing it securely into your memory structures. This pattern will serve you well.
  • Thank you for your response, I really appreciate it. So would it be something like while(!feof(fptr)){ fread(some_linked_list_pointer, sizeof(int)+sizeof(char), 1, fptr); }