Node Level Problem Solved

Author: MohammadFahad1

Node Level.cpp

@@ -0,0 +1,42 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+template <typename T>
+class TreeNode
+{
+public:
+    T val;
+    bool isOriginal;
+    TreeNode<T> *left;
+    TreeNode<T> *right;
+
+    TreeNode(T val)
+    {
+        this->val = val;
+        left = NULL;
+        right = NULL;
+    }
+};
+
+int nodeLevel(TreeNode<int> *root, int searchedValue)
+{
+    // Write your code here.
+    queue<pair<TreeNode<int> *, int>> q;
+    // q.push(make_pair(root, 1));
+    q.push({root, 1});
+    while (!q.empty())
+    {
+        pair<TreeNode<int> *, int> parent = q.front();
+        TreeNode<int> *node = parent.first;
+        int level = parent.second;
+        q.pop();
+
+        if (node->val == searchedValue)
+            return level;
+
+        if (node->left)
+            q.push({node->left, level + 1});
+        if (node->right)
+            q.push({node->right, level + 1});
+    }
+}