Skip to content
Closed
Changes from all commits
Commits
File filter

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
62 changes: 62 additions & 0 deletions Trees/leftviewoftree.cpp
Original file line number Diff line number Diff line change
@@ -0,0 +1,62 @@
// C++ program to print left view of Binary Tree
#include <bits/stdc++.h>
using namespace std;

struct Node
{
int data;
struct Node *left, *right;
};


struct Node *newNode(int item)
{
struct Node *temp = (struct Node *)malloc(
sizeof(struct Node));
temp->data = item;
temp->left = temp->right = NULL;
return temp;
}

// left view of a binary tree.
void leftViewUtil(struct Node *root,
int level, int *max_level)
{

if (root == NULL) return;


if (*max_level < level)
{
cout << root->data << " ";
*max_level = level;
}

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

}


void leftView(struct Node *root)
{
int max_level = 0;
leftViewUtil(root, 1, &max_level);
}

int main()
{
Node* root = newNode(10);
root->left = newNode(2);
root->right = newNode(3);
root->left->left = newNode(7);
root->left->right = newNode(8);
root->right->right = newNode(15);
root->right->left = newNode(12);
root->right->right->left = newNode(14);

leftView(root);

return 0;
}