CodingQuestions/left_view_of_binary_tree.cpp at master · ayushmnnit/CodingQuestions

Repository navigation

History

// C program to print left view of Binary Tree

#include<stdio.h>

#include<stdlib.h>

struct node

{

int data;

struct node *left, *right;

};

// A utility function to create a new Binary Tree node

struct node *newNode(int item)

{

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

temp->data = item;

temp->left = temp->right = NULL;

return temp;

}

// Recursive function to print left view of a binary tree.

void leftViewUtil(struct node *root, int level, int *max_level)

{

// Base Case

if (root==NULL) return;

// If this is the first node of its level

if (*max_level < level)

{

printf("%d\t", root->data);

*max_level = level;

}

// Recur for left and right subtrees

leftViewUtil(root->left, level+1, max_level);

leftViewUtil(root->right, level+1, max_level);

}

// A wrapper over leftViewUtil()

void leftView(struct node *root)

{

int max_level = 0;

leftViewUtil(root, 1, &max_level);

}

// Driver Program to test above functions

int main()

{

struct node *root = newNode(12);

root->left = newNode(10);

root->right = newNode(30);

root->right->left = newNode(25);

root->right->right = newNode(40);

leftView(root);

return 0;

}

FilesExpand file tree

left_view_of_binary_tree.cpp

Latest commit

History

left_view_of_binary_tree.cpp

File metadata and controls