C Programming

Union

Like Structures, union is a user defined data type. In union, all members share the same memory location. For example in the following C program, both x and y share the same location. If we change x, we can see the changes being reflected in y.

#include <stdio.h>

// Declaration of union is same as structures
union test
{
   int x, y;
};

int main()
{
    // A union variable t
    union test t;

    t.x = 2; // t.y also gets value 2
    printf ("After making x = 2:\n x = %d, y = %d\n\n",
             t.x, t.y);

    t.y = 10;  // t.x is also updated to 10
    printf ("After making Y = 'A':\n x = %d, y = %d\n\n",
             t.x, t.y);
    return 0;
}

Output:

After making x = 2:
 x = 2, y = 2

After making Y = 'A': x = 10, y = 10

 
How is the size of union decided by compiler?
Size of a union is taken according the size of largest member in union.

#include <stdio.h>

union test1
{
   int x;
   int y;
};

union test2
{
   int x;
   char y;
};

union test3
{
   int arr[10];
   char y;
};

int main()
{
   union test1 var1 ; 
   union test2 var2 ; 
   union test3 var3 ;
   printf ("sizeof(var1) = %lu, sizeof(var2) = %lu,"
            "sizeof(var3) =  %lu", sizeof(var1),
            sizeof(var2), sizeof(var3));
    return 0;
}

Output

sizeof(var1) = 4, sizeof(var2) = 4,sizeof(var3) =  40
 
Pointers to unions?
Like structures, we can have pointers to unions and can access members using arrow operator (->). The following example demonstrates the same.

#include<stdio.h>
union test
{
   int x;
   char y;
};

int main()
{
   union test p1;
   p1.x = 65;

   // p2 is a pointer to union p1
   union test *p2 = &p1;

   // Accessing union members using pointer
   printf("%d %c", p2->x, p2->y);
   return 0;
}
65 A 

What are applications of union?
Unions can be useful in many situations where we want to use same memory for two ore more members. For example, suppose we want to implement a binary tree data structure where each leaf node has a double data value, while each internal node has pointers to two children, but no data. If we declare this as:

struct NODE {
  struct NODE *left;
  struct NODE *right;
  double data;
};

then every node requires 16 bytes, with half the bytes wasted for each type of node. On the other hand, if we declare a node as following, then we can save space.

struct NODE
{
    bool is_leaf;
    union
    {
        struct
        {
            struct NODE *left;
            struct NODE *right;
        } internal;
        double data;
    } info;
};

Recent Comments

Feedback

For any feedback,email us at feedback@geeksforgeeks.org

Report a Bug

For any report or bug,email us at support@geeksforgeeks.org