data-structures-and-algorithms/RightViewTree.cpp at main · Open-code-source/data-structures-and-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
#include <iostream>
#include<queue>
using namespace  std;

class Node{
public:
	int data;
	Node *left,*right;

	Node(int val){
		data=val;
		left=right=NULL;
	}
};

void rightview(Node *root){

	if(root==NULL){
		return;
	}

	queue<Node*> q;
	q.push(root);

	while(!q.empty()){
		int n=q.size();
		for (int i = 0; i < n; i++)
		{
			Node *curr=q.front();
			q.pop();

			if(i==n-1){
				cout<<curr->data<<" ";
			}

			if(curr->left!=NULL){
				q.push(curr->left);
			}

			if (curr->right!=NULL)
			{
				q.push(curr->right);
			}
		}
	}
}


void lefttview(Node *root){
	if(root==NULL){
		return;
	}

	queue<Node*> q;
	q.push(root);

	while(!q.empty()){

		int n=q.size();

		for (int i = 1; i <=n; i++)
		{

			Node *curr=q.front();
			q.pop();
			if(i==1){
				cout<<curr->data<<" ";
			}
			if(curr->left!=NULL){
				q.push(curr->left);
			}
			if(curr->right!=NULL){
				q.push(curr->right);
			}
		}
	}
}


int main(){

Node *root=new Node(5);
	root->left=new Node(3);
	root->right=new Node(6);
	root->left->left=new Node(2);
	root->left->right=new Node(4);


	// rightview(root);

	lefttview(root);


	return 0;
}