Data Structures Tutorial

Data Structures Tutorial Asymptotic Notation Structure and Union Array Data Structure Linked list Data Structure Type of Linked list Advantages and Disadvantages of linked list Queue Data Structure Implementation of Queue Stack Data Structure Implementation of Stack Sorting Insertion sort Quick sort Selection sort Heap sort Merge sort Bucket sort Count sort Radix sort Shell sort Tree Traversal of the binary tree Binary search tree Graph Spanning tree Linear Search Binary Search Hashing Collision Resolution Techniques

Misc Topic:

Priority Queue in Data Structure Deque in Data Structure Difference Between Linear And Non Linear Data Structures Queue Operations In Data Structure About Data Structures Data Structures Algorithms Types of Data Structures Big O Notations Introduction to Arrays Introduction to 1D-Arrays Operations on 1D-Arrays Introduction to 2D-Arrays Operations on 2D-Arrays Strings in Data Structures String Operations Application of 2D array Bubble Sort Insertion Sort Sorting Algorithms What is DFS Algorithm What Is Graph Data Structure What is the difference between Tree and Graph What is the difference between DFS and BFS Bucket Sort Dijkstra’s vs Bellman-Ford Algorithm Linear Queue Data Structure in C Stack Using Array Stack Using Linked List Recursion in Fibonacci Stack vs Array What is Skewed Binary Tree Primitive Data Structure in C Dynamic memory allocation of structure in C Application of Stack in Data Structures Binary Tree in Data Structures Heap Data Structure Recursion - Factorial and Fibonacci What is B tree what is B+ tree Huffman tree in Data Structures Insertion Sort vs Bubble Sort Adding one to the number represented an array of digits Bitwise Operators and their Important Tricks Blowfish algorithm Bubble Sort vs Selection Sort Hashing and its Applications Heap Sort vs Merge Sort Insertion Sort vs Selection Sort Merge Conflicts and ways to handle them Difference between Stack and Queue AVL tree in data structure c++ Bubble sort algorithm using Javascript Buffer overflow attack with examples Find out the area between two concentric circles Lowest common ancestor in a binary search tree Number of visible boxes putting one inside another Program to calculate the area of the circumcircle of an equilateral triangle Red-black Tree in Data Structures Strictly binary tree in Data Structures 2-3 Trees and Basic Operations on them Asynchronous advantage actor-critic (A3C) Algorithm Bubble Sort vs Heap Sort Digital Search Tree in Data Structures Minimum Spanning Tree Permutation Sort or Bogo Sort Quick Sort vs Merge Sort Boruvkas algorithm Bubble Sort vs Quick Sort Common Operations on various Data Structures Detect and Remove Loop in a Linked List How to Start Learning DSA Print kth least significant bit number Why is Binary Heap Preferred over BST for Priority Queue Bin Packing Problem Binary Tree Inorder Traversal Burning binary tree Equal Sum What is a Threaded Binary Tree? What is a full Binary Tree? Bubble Sort vs Merge Sort B+ Tree Program in Q language Deletion Operation from A B Tree Deletion Operation of the binary search tree in C++ language Does Overloading Work with Inheritance Balanced Binary Tree Binary tree deletion Binary tree insertion Cocktail Sort Comb Sort FIFO approach Operations of B Tree in C++ Language Recaman’s Sequence Tim Sort Understanding Data Processing Applications of trees in data structures Binary Tree Implementation Using Arrays Convert a Binary Tree into a Binary Search Tree Create a binary search tree Horizontal and Vertical Scaling Invert binary tree LCA of binary tree Linked List Representation of Binary Tree Optimal binary search tree in DSA Serialize and Deserialize a Binary Tree Tree terminology in Data structures Vertical Order Traversal of Binary Tree What is a Height-Balanced Tree in Data Structure Convert binary tree to a doubly linked list Fundamental of Algorithms Introduction and Implementation of Bloom Filter Optimal binary search tree using dynamic programming Right side view of binary tree Symmetric binary tree Trim a binary search tree What is a Sparse Matrix in Data Structure What is a Tree in Terms of a Graph What is the Use of Segment Trees in Data Structure What Should We Learn First Trees or Graphs in Data Structures All About Minimum Cost Spanning Trees in Data Structure Convert Binary Tree into a Threaded Binary Tree Difference between Structured and Object-Oriented Analysis FLEX (Fast Lexical Analyzer Generator) Object-Oriented Analysis and Design Sum of Nodes in a Binary Tree What are the types of Trees in Data Structure What is a 2-3 Tree in Data Structure What is a Spanning Tree in Data Structure What is an AVL Tree in Data Structure Given a Binary Tree, Check if it's balanced B Tree in Data Structure Convert Sorted List to Binary Search Tree Flattening a Linked List Given a Perfect Binary Tree, Reverse Alternate Levels Left View of Binary Tree What are Forest Trees in Data Structure Compare Balanced Binary Tree and Complete Binary Tree Diameter of a Binary Tree Given a Binary Tree Check the Zig Zag Traversal Given a Binary Tree Print the Shortest Path Given a Binary Tree Return All Root To Leaf Paths Given a Binary Tree Swap Nodes at K Height Given a Binary Tree Find Its Minimum Depth Given a Binary Tree Print the Pre Order Traversal in Recursive Given a Generate all Structurally Unique Binary Search Trees Perfect Binary Tree Threaded Binary Trees Function to Create a Copy of Binary Search Tree Function to Delete a Leaf Node from a Binary Tree Function to Insert a Node in a Binary Search Tree Given Two Binary Trees, Check if it is Symmetric A Full Binary Tree with n Nodes Applications of Different Linked Lists in Data Structure B+ Tree in Data Structure Construction of B tree in Data Structure Difference between B-tree and Binary Tree Finding Rank in a Binary Search Tree Finding the Maximum Element in a Binary Tree Finding the Minimum and Maximum Value of a Binary Tree Finding the Sum of All Paths in a Binary Tree Time Complexity of Selection Sort in Data Structure How to get Better in Data Structures and Algorithms Binary Tree Leaf Nodes Classification of Data Structure Difference between Static and Dynamic Data Structure Find the Union and Intersection of the Binary Search Tree Find the Vertical Next in a Binary Tree Finding a Deadlock in a Binary Search Tree Finding all Node of k Distance in a Binary Tree Finding Diagonal Sum in a Binary Tree Finding Diagonal Traversal of The Binary Tree Finding In-Order Successor Binary Tree Finding the gcd of Each Sibling of the Binary Tree Greedy Algorithm in Data Structure How to Calculate Space Complexity in Data Structure How to find missing numbers in an Array Kth Ancestor Node of Binary Tree Minimum Depth Binary Tree Mirror Binary Tree in Data Structure Red-Black Tree Insertion Binary Tree to Mirror Image in Data Structure Calculating the Height of a Binary Search Tree in Data Structure Characteristics of Binary Tree in Data Structure Create a Complete Binary Tree from its Linked List Field in Tree Data Structure Find a Specified Element in a binary Search Tree Find Descendant in Tree Data Structure Find Siblings in a Binary Tree Given as an Array Find the Height of a Node in a Binary Tree Find the Second-Largest Element in a Binary Tree Find the Successor Predecessor of a Binary Search Tree Forest of a Tree in Data Structure In Order Traversal of Threaded Binary Tree Introduction to Huffman Coding Limitations of a Binary Search Tree Link State Routing Algorithm in Data Structure Map Reduce Algorithm for Binary Search Tree in Data Structure Non-Binary Tree in Data Structure Quadratic Probing Example in Hashing Scope and Lifetime of Variables in Data Structure Separate Chaining in Data Structure What is Dynamic Data Structure Separate Chaining vs Open Addressing Time and Space Complexity of Linear Data Structures Abstract Data Types in Data Structures Binary Tree to Single Linked List Count the Number of Nodes in the Binary Tree Count Total No. of Ancestors in a Binary Search Tree Elements of Dynamic Programming in Data Structures Find cost of tree with prims algorithm in data structures Find Preorder Successor in a Threaded Binary Tree Find Prime Nodes Sum Count in Non-Binary Tree Find the Right Sibling of a Binary Tree with Parent Pointers Find the Width of the Binary Search Tree Forest trees in Data Structures Free Tree in Data Structures Frequently asked questions in Tree Data Structures Infix, Postfix and Prefix Conversion Time Complexity of Fibonacci Series What is Weighted Graph in Data Structure What is the Advantage of Linear Search?

Introduction to 1D-Arrays

One Dimensional Array

Technical Definitions

The simplest version of an Array is a One-Dimensional Array, in which the items are stored linearly and may be accessed individually by supplying the index value of each member in the array.

A One-Dimensional Array is a collection of objects of the same data type that are stored in a linear order under the same variable name.

One Dimensional Array in C: An Overview

In C, a one-dimensional array may be seen as a single row where the elements are stored. All of the components are stored in memory at the same time. Now we'll look at declaring, initialising, and accessing array elements:

Introduction to 1D-Arrays

Declaration of an Array

The data type can be any type when declaring a one-dimensional array in C, and the array can be given any name, much like a random variable. Syntax:

int array[10]; //where array is the name of the integer type array, and 10 is the size of the array

Initialization of an array

All entries in static uninitialized arrays have garbage values at first, but we may explicitly initialise them at their declaration.


<data_type> <array_name> [array_size]={value1, value2, value3,…};
  • An array's datatype is the type of its items.
  • The variable name is array_name, which can be any valid identifier.
  • size refers to the array's size.
  • Initializers are constants like value1, value2, and so on. A comma(,) separates each value, followed by a semi-colon (;) after the closing curly brace ().
  • A comma separates parameterized values from constant values.

If we explicitly initialise array items within the list at the time of declaration, we may avoid expressing the array size within square brackets. In that scenario, the size of the items list will be used as the array size.


int array[10]; //where array is the name of the integer type array, and 10 is the size of the array

If we wish to set the value of all integer array items to zero, we can simply write:

int <array name>[size] = {0};

Accessing an Array Element

Elements are accessible in one-dimensional arrays in C by supplying the array name and the index value within square brackets. The indexing of an array begins at 0 and ends at size-1. If we try to access array items outside of the range, the compiler will return a trash value rather than an error message.




int numbers[5] = {0, 1, 2, 3, 4};
printf("%d", numbers[0]); //Array element at index 0 is printed
printf("%d", numbers[-1]); //Garbage value will be printed

In C, here's a programme that shows how to declare, initialise, and access elements in a one-dimensional array:

#include <stdio.h>
int main() {
int array[3] = {11, 23, 39}; //declaring and initializing one-dimensional array in C

// After declaration, we can also initialize array as:
// array[0] = 11; array[1] = 23; array[2] = 39;

for (int i = 0; i < 3; i++) {
// accessing elements of array
printf(" Value of array[%d]: %d\n", i, array[i]);


Value of array[0]: 11
Value of array[1]: 23
Value of array[2]: 39

We initialised an array of size 3 and the name array in this C programming code at the time of declaration. We're trying to print the array values by accessing its elements at the conclusion of the function.

One-Dimensional Array Declarative Rules

In C, there are several rules for declaring a one-dimensional array.

  • The array variable must be declared before it may be used or accessed.
  • Indexing in an array begins at 0 and finishes at size-1. For example, if arr[10] has a size of 10, element indexing runs from 0 to 9.
  • When declaring one-dimensional arrays in C, we must provide the data type and variable name.
  • When the declaration provides array size within square brackets, we can explicitly initialise them.
  • Each array element is stored in a contiguous memory area and is accessed using a unique index number.

C One-Dimensional Array Initialization

We can either initialise array items after declaration or do so directly at the time of declaration. In C, one-dimensional arrays are either populated at compile time or at run time.

Initialization at Compile Time

Static-initialization is another name for compile-time initialization. When we define the array implicitly, the array items are initialised.


<data_type> <array_name> [array_size] = { list of elements};


int age[5] = {27, 32, 16, 72, 4};

Compile-Time Initialization is demonstrated using a C programme:

#include <stdio.h>
int main(){
    int numbers[3]={10,9,8};
    printf(" Compile-Time Initialization Example:\n");
    printf(" %d ",numbers[0]);
    printf("%d ",numbers[1]);
    printf("%d ",numbers[2]);


10 9 8

In this C programme code, we've created a three-dimensional array numbers with the entries 10, 9, and 8 in the list. This is compile-time initialization, and we've printed all of its values by accessing index-wise at the end.

Initialization at Runtime

Dynamic-initialization is another name for runtime initialization. After the programme has been properly compiled, the array entries are initialised during runtime.


scanf("%d", &numbers[0]); //initializing 0th index element at runtime dynamically

The following is a C programme that demonstrates Run-Time Initialization:

#include <stdio.h>

int main() {
int numbers[10];
printf("\n Example of Run-Time Initialization:\n");
printf("\n Enter the array elements: ");

for (int i = 0; i < 10; i++) {
scanf("%d", &numbers[i]);

printf(" Accessing array elements after dynamic Initialization: ");

for (int i = 0; i < 10; i++) {
printf("%d ", numbers[i]);
    return 0;


Example of Run-Time Initialization:    

Enter the array elements: 100 90 80 70 60


Accessing array elements after dynamic Initialization: 100 90 80 70 60

In this C programming code, we've just declared an array numbers of size 5 to show runtime initialization. Following that, we ask the user to enter the array values to initialise it when the code has been compiled. Finally, we printed the values by accessing them index-by-index.

In C, Copying One-Dimensional Arrays

If we have two arrays, first_array and second_array, one of which is initialised and the other of which is just defined, and we need to copy elements from first_array to second_array, we can't just write:

int first_array[5] = {5,4,3,2,1};
int second_array[5];
second_array = first_array; //This statement is wrong, it will produce an error

The main requirement for copying an array is that the copy array's size be smaller than the original array's.

In C, create a programme to demonstrate copying elements of a one-dimensional array.

#include <stdio.h>

int main() {
int first_array[5] = {60, 50, 40, 30, 20};
int second_array[5];
printf("Copying One-Dimensional Arrays in C:\n");
printf("First_array elements: ");

for (int i = 0; i < 5; i++) {
printf("%d ", first_array[i]);
second_array[i] = first_array[i]; // Copying first_array elements to second_array

printf("\nSecond_array elements after copying: ");

for (int i = 0; i < 5; i++) {
printf("%d ", second_array[i]);


Copying One-Dimensional Arrays in C:
First_array elements: 10 20 30 40 50 
Second_array elements after copying: 10 20 30 40 50 

We've used two arrays in our C programming code: first_array and second_array. We are allocating first_array values to second_array within a loop to demonstrate the notion of copying array items. first_array has been initialised at the time of declaration. We've printed the values of both arrays at the end.

Points to Keep in Mind When Using an Array in C

  • At C, an array is a group of comparable data-type items that are stored in the same memory region.
  • All of the elements in a C array have the same data type and may be accessed using their unique index value.
  • The indexing of an array begins at 0 and ends at size-1.
  • In C, one-dimensional arrays can be populated statically (at build time) or dynamically (during runtime) (during runtime).
  • When declaring one-dimensional arrays in C, we must specify the data type, array variable name, and array size in square brackets.


  • In C, arrays are derived data types that contain components of the same data type.
  • Indexing in one-dimensional arrays in C starts at 0 and stops at size-1, and attempting to retrieve an element outside of this range will result in a garbage value.
  • When declaring one-dimensional arrays in C, we must add a data type, array variable name, and array size in square brackets.
  • In C, one-dimensional arrays can be populated statically (at build time) or dynamically (during runtime) (during runtime).
  • Because all of the items of an array are stored in contiguous memory regions, we may use their unique index number to retrieve them.