Leaf node problem solved

Author: MohammadFahad1

.cph/.Leaf_Nodes.cpp_6e6e11e10e15ae7712de2e4674d18ec1.prob

@@ -0,0 +1 @@
+{"name":"Leaf Nodes","group":"HackerRank - Assignment 04 | Basic Data Structure | Batch 05","url":"https://www.hackerrank.com/contests/assignment-04-a-basic-data-structure-a-batch-05/challenges/leaf-nodes-1","interactive":false,"memoryLimit":512,"timeLimit":4000,"tests":[{"id":1724474168402,"input":"10 20 30 40 50 -1 60 -1 -1 -1 -1 -1 -1\n","output":"60 50 40\n"}],"testType":"single","input":{"type":"stdin"},"output":{"type":"stdout"},"languages":{"java":{"mainClass":"Main","taskClass":"LeafNodes"}},"batch":{"id":"b6171924-2d9e-4ee9-96fa-5203eb11ce02","size":1},"srcPath":"f:\\Tutorials\\Video Tutorials\\Phitron\\3. Basic Data Structures\\Leaf_Nodes.cpp"}

Leaf_Nodes.bin

@@ -0,0 +1,84 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+class Node
+{
+public:
+    int val;
+    Node *left;
+    Node *right;
+    Node(int val)
+    {
+        this->val = val;
+        this->left = NULL;
+        this->right = NULL;
+    }
+};
+
+Node *input_binary_tree()
+{
+    int val;
+    cin >> val;
+    Node *root;
+    if (val == -1)
+        root = NULL;
+    else
+        root = new Node(val);
+    queue<Node *> q;
+    if (root)
+        q.push(root);
+
+    while (!q.empty())
+    {
+        Node *f = q.front();
+        q.pop();
+
+        int l, r;
+        cin >> l >> r;
+
+        Node *left, *right;
+        if (l == -1)
+            left = NULL;
+        else
+            left = new Node(l);
+
+        if (r == -1)
+            right = NULL;
+        else
+            right = new Node(r);
+
+        f->left = left;
+        f->right = right;
+
+        if (f->left)
+            q.push(f->left);
+        if (f->right)
+            q.push(f->right);
+    }
+    return root;
+}
+
+vector<int> v;
+
+void leafNodeValues(Node *root)
+{
+    if (root == NULL)
+        return;
+    if (root->left == NULL && root->right == NULL)
+        v.push_back(root->val);
+    leafNodeValues(root->left);
+    leafNodeValues(root->right);
+}
+
+int main()
+{
+    Node *root = input_binary_tree();
+    leafNodeValues(root);
+    sort(v.begin(), v.end(), greater<int>());
+    for (int i : v)
+    {
+        cout << i << " ";
+    }
+
+    return 0;
+}