C Program to Print Left View of a Binary Tree

This C Program Prints only Nodes in Left SubTree.

Here is source code of the C program to Print only Nodes in Left SubTree. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

```
/*
```

 * C Program to Print only Nodes in Left SubTree

```
 */
```
```
#include <stdio.h>
```
```
#include <stdlib.h>
```
```
 
```
```
struct node
```
```
{
```
```
    int data;
```
```
    struct node* left;
```
```
    struct node* right;
```
```
};
```
```
 
```
```
int queue[100];
```
```
int front = 0, rear = 0, val; 
```
```
 
```

/*Function to traverse the tree using Breadth First Search*/

```
void bfs_traverse(struct node *node)
```
```
{
```
```
    val = node->data;
```

    if ((front< = rear)&&(node->data =  = queue[front]))

```
    {
```
```
        if (node->left != NULL)
```

            queue[rear++] = node->left->data;

```
        if (node->right != NULL)
```

            queue[rear++] = node->right->data;

```
        front++;
```
```
    }
```
```
    if (node->left != NULL)
```
```
    {
```
```
        bfs_traverse(node->left);
```
```
    }
```
```
    if (node->right != NULL)
```
```
    {
```
```
        bfs_traverse(node->right);
```
```
    }
```
```
}
```
```
 
```
```
struct node* newnode(int data)
```
```
{
```

    struct node* node  =  (struct node *)malloc(sizeof(struct node));

```
    node->data  =  data;
```
```
    node->left  =  NULL;
```
```
    node->right  =  NULL;
```
```
 
```
```
    return(node);
```
```
}
```
```
 
```
```
int main()
```
```
{ 
```
```
    int i;
```
```
 
```
```
    /*
```
```
    The input tree is as shown below
```
```
                40
```
```
                / \
```
```
            20        60
```
```
            / \       \
```
```
        10        30      80
```
```
                          \
```
```
                            90
```
```
    */
```
```
    struct node *root  =  newnode(40);
```
```
    root->left         =  newnode(20);
```
```
    root->right        =  newnode(60);
```
```
    root->left->left   =  newnode(10);
```
```
    root->left->right  =  newnode(30);
```
```
    root->right->right  =  newnode(80);
```

    root->right->right->right  =  newnode(90);

```
    queue[rear++] = root->left->data;
```
```
    bfs_traverse(root->left);
```
```
    for (i = 0;i < rear;i++)
```
```
        printf("%d->", queue[i]);
```
```
    return 0;
```
```
}
```

$ cc tree32.c
$ a.out
20->10->30->

Sanfoundry Global Education & Learning Series – 1000 C Programs.

Here’s the list of Best Books in C Programming, Data-Structures and Algorithms

If you wish to look at programming examples on all topics, go to C Programming Examples.

If you find any mistake above, kindly email to [email protected]

« Prev - C Program to Print All Paths from Root to Leaf in a Tree

» Next - C Program to Construct a Tree and Perform Tree Operations

Related Posts:

Check Computer Science Books
Practice Computer Science MCQs
Practice Design & Analysis of Algorithms MCQ
Practice Programming MCQs
Apply for Computer Science Internship

Recommended Articles: