Leetcode/univalued_binary_tree.cpp at main · dev-morsalin-islam/Leetcode · 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
//program to check if a binary tree contains same value or not
//problem link: https://leetcode.com/problems/univalued-binary-tree/


/**
 * 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:
    bool isUnivalTree(TreeNode* root) {
       if(root == NULL) return true;
       queue<TreeNode*>q;
       q.push(root);
       while(!q.empty())
       {
           TreeNode * front = q.front();
           q.pop();
           if(front -> left)
           {
               if(front -> left -> val != front -> val) return false;
               else q.push(front -> left);
           }
           if(front -> right)
           {
               if(front -> right -> val != front -> val) return false;
               else q.push(front -> right);
           }
       }
       return true;

    }
};