Count max height of the binary tree

Author: MohammadFahad1

count_max_height_of_a_binary_tree.cpp

@@ -0,0 +1,83 @@
+#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())
+    {
+        // 1. Q theke ber kore ano
+        Node *f = q.front();
+        q.pop();
+
+        // 2. Jabotiyo ja kaj ache koro
+        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;
+
+        // 3. Children gulo k push koro
+        if (f->left)
+            q.push(f->left);
+        if (f->right)
+            q.push(f->right);
+    }
+    return root;
+}
+
+int count_height(Node *root)
+{
+    if (!root)
+        return 0;
+    int l = count_height(root->left);
+    int r = count_height(root->right);
+    return max(l, r) + 1;
+}
+
+int main()
+{
+    Node *root = input_binary_tree();
+    cout << count_height(root) << endl;
+
+    return 0;
+}

count_max_height_of_a_binary_tree.exe

@@ -1 +1 @@
-10 20 50 30 40 70 60 -1 -1 -1 -1 -1 80 -1 -1 -1 -1
+10 20 30 70 150 120 40 80 90 -1 -1 130 -1 60 50 -1 -1 100 -1 -1 140 -1 -1 -1 -1 -1 110 -1 -1 -1 -1 

input.txt

@@ -1 +1 @@
-4
+6