Leetcode-Solutions/left_view_bt.cpp at master · cpj2195/Leetcode-Solutions · 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
#include "essentials.cpp"


void left_view(struct bnode*root){

if(root==NULL){
    return;
}
else{

queue<struct bnode*>q;
q.push(root);

struct bnode*temp=root;
bool flag=false;
while(!q.empty()){
int size=q.size();

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

    temp=q.front();
    q.pop();


    if(i==1){
        cout<<temp->data<<" ";

    }


    if(temp->left){
        q.push(temp->left);
    }
    if(temp->right){
        q.push(temp->right);}

}


}


}


}


int main(){


struct bnode *root = newNode(38);
    root->left     = newNode(30);
    root->right     = newNode(56);
    root->left->right = newNode(35);
    root->left->right->left = newNode(32);
    root->left->right->right = newNode(36);
    root->right->right = newNode(60);
    root->right->left = newNode(40);
    root->left->left=newNode(20);

    left_view(root);


    return 1;

}