FilesExpand file tree

 main

/

BinaryTreeRightSideViewProg.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

46 lines (39 loc) · 1.21 KB

 main

/

BinaryTreeRightSideViewProg.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

46 lines (39 loc) · 1.21 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

// BINARY TREE RIGHT SIDE VIEW (LEETCODE 199) SOLUTION

// Question : https://leetcode.com/problems/binary-tree-right-side-view/

//--------------------------------------------------------------------------

/*

* Definition for a binary tree node.

* struct TreeNode {

* int val;

* TreeNode *left;

* TreeNode *right;

* TreeNode() : val(0), left(nullptr), right(nullptr) {}

* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}

* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}

* };

*/

class Solution {

public:

vector<int> ans;

vector<int> rightSideView(TreeNode* root) {

if(root==NULL)return ans;

queue<TreeNode*>q;

q.push(root);

// Level order transversal

while(!q.empty()){

int s=q.size();

int dat=0;

while(s){

TreeNode*temp=q.front();

q.pop();

dat=temp->val;

if(temp->left!=NULL)q.push(temp->left);

if(temp->right!=NULL)q.push(temp->right);

s--;

}

// Simply push ush the last value

ans.push_back(dat);

}

return ans;

}

};