# How to create a node in C?

A node is a small concept taken from the graph theory, or a node is a fundamental unit of a data structure, like a tree data structure. Every graph contains nodes which are also called vertices, and edges, where these edges are used to connect the vertices (nodes). In c programming, a node is taken as a structure that contains all required data elements on the board to construct a graph. To get a proper structure with nodes, we need edges.

In this article, you will learn about the creation of a Node in c language, how and where we use this Node with the help of code in C. And, we will also study various aspects of Node in the programming languages.

## Steps to create a node in c:

Now we will write a c program solving the create Node in c.

``````typedef struct node{
int value; //this is the value that a node stores
struct node *next;  // for the node here is the current Node points to. this is how the nodes link
}node;
node *CreateNode(int val){
node *NewNode = malloc(sizeof(node));
newNode->value = val;
newNode->next = NULL;
return newNode;
}
``````

After doing the above code, the following code will summarize many methods that will be used to solve the node problems in the C program.

``````typedef struct node
{
int number;
struct node *next;
}
node;
``````

### Creating a node in the linked list:

The above two codes are to create a node in a standard c program. If you want to create a node in a linked list in a c program, the algorithm used to make is

• Start
• First, create a class node containing two attributes (data and next). Here next acts as a pointer to the next Node.
• Now create another class containing two more attributes (head and tail)
• Now we use the function add Node (), which will add a new node to the list.
• Now we use the display () function, and this will display the nodes that are present in the list.
• End.

Always the essential thing is to create a node. That can be done by using the function called malloc. And this function creates a starting node for a list. Based on this algorithm, we can create a node in the linked list whenever it is needed in c or any other programming language.

### For creating a new node:

To create a new node, we make the previous Node the next new Node. And with this, we declared the head pointer and made it NULL. Then we give a structure to the Node as

`Struct node{ int data; struct node *next;}; struct node*head = NULL;`

With this, it creates a new node; if the head node is NULL, then make the new Node the head. Else take the last Node or the end node and make it the new Node.

### Types of nodes:

• Originating Node- user submits the request to transmit the data to another node.
• Intermediate Node- the Node that lies in the path of either two other nodes.
• Originating Node- start Node.
• Execution node or the destination node- end node.

### The basic syntax for node creation:

The basic syntax to create a node is to use CREATE statement. And with this statement, we also must specify their properties in curly braces and separated commas.

Example statement:

`CREATE (node:hello{key1: 2, key2: 4, .........}`

Therefore, creating this Node defines a structure and refers to the memory allocation. Creating a node means the initialization of a value. So creating a node is very much required in graphs. A node will always contain some data and relate to another node.

Many modules related to graphs are implemented in C OR C++ with Node.js. Node.js internally has a complete collection of few dependencies which were actually used to execute a code.