Algorithm Binary Tree C Programming Coding

C Programming – Binary Tree | Set 1 (Introduction)

C Programming - Binary Tree (Introduction) - A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can

Trees: Unlike Arrays, Linked Lists, Stack and queues, which are linear data structures, trees are hierarchical data structures.

Tree Vocabulary: The topmost node is called root of the tree. The elements that are directly under an element are called its children. The element directly above something is called its parent. For example, a is a child of f and f is the parent of a. Finally, elements with no children are called leaves.

       j    <-- root
     /   \
    f      k  
  /   \      \
 a     h      z    <-- leaves

Why Trees?
1. One reason to use trees might be because you want to store information that naturally forms a hierarchy. For example, the file system on a computer:

file system
     /    <-- root
  /      \
...       home
      /          \
   ugrad        course
    /       /      |     \
  ...      cs101  cs112  cs113

2. Trees (with some ordering e.g., BST) provide moderate access/search (quicker than Linked List and slower than arrays).
3. Trees provide moderate insertion/deletion (quicker than Arrays and slower than Unordered Linked Lists).
4. Like Linked Lists and unlike Arrays, Trees don’t have an upper limit on number of nodes as nodes are linked using pointers.

Main applications of trees include:
1. Manipulate hierarchical data.
2. Make information easy to search (see tree traversal).
3. Manipulate sorted lists of data.
4. As a workflow for compositing digital images for visual effects.
5. Router algorithms
6. Form of a multi-stage decision-making (see business chess).

Binary Tree: A tree whose elements have at most 2 children is called a binary tree. Since each element in a binary tree can have only 2 children, we typically name them the left and right child.

Binary Tree Representation in C: A tree is represented by a pointer to the topmost node in tree. If the tree is empty, then value of root is NULL.
A Tree node contains following parts.
1. Data
2. Pointer to left child
3. Pointer to right child

READ  C++ Programming - Measure one litre using two vessels and infinite water supply

in C, we can represent a tree node using structures. Below is an example of a tree node with an integer data.

struct node 
  int data;
  struct node *left;
  struct node *right;

First Simple Tree in C
Let us create a simple tree with 4 nodes in C. The created tree would be as following.

       1    <-- root
     /   \
    2     3  
struct node 
    int data;
    struct node *left;
    struct node *right;
/* newNode() allocates a new node with the given data and NULL left and 
   right pointers. */
struct node* newNode(int data)
  // Allocate memory for new node 
  struct node* node = (struct node*)malloc(sizeof(struct node));
  // Assign data to this node
  node->data = data;
  // Initialize left and right children as NULL
  node->left = NULL;
  node->right = NULL;
int main()
  /*create root*/
  struct node *root = newNode(1);  
  /* following is the tree after above statement 
      /   \
     NULL  NULL  
  root->left        = newNode(2);
  root->right       = newNode(3);
  /* 2 and 3 become left and right children of 1
         /   \
        2      3
     /    \    /  \
  root->left->left  = newNode(4);
  /* 4 becomes left child of 2
       /       \
      2          3
    /   \       /  \
   4    NULL  NULL  NULL
  /  \
  return 0;

About the author

Venkatesan Prabu

Venkatesan Prabu

Wikitechy Founder, Author, International Speaker, and Job Consultant. My role as the CEO of Wikitechy, I help businesses build their next generation digital platforms and help with their product innovation and growth strategy. I'm a frequent speaker at tech conferences and events.

Add Comment

Click here to post a comment