Added solutions

Author: avidLearnerInProgress

amazon/clone_tree.cpp

@@ -1,3 +1,4 @@
+//https://practice.geeksforgeeks.org/problems/clone-a-binary-tree/1
 {
 #include <bits/stdc++.h>
 using namespace std;

amazon/count_2s.py

@@ -0,0 +1,21 @@
+{
+#Initial Template for Python 3
+if __name__ == "__main__":
+    t=int(input())
+    for i in range(t):
+        n=int(input())
+        print(numberOf2sinRange(n))
+}
+''' This is a function problem.You only need to complete the function given below '''
+#User function Template for python3
+def number0f2s(n):
+    curr = str(n)
+    return curr.count('2')
+    #add Code here
+    
+def numberOf2sinRange(n):
+    res = 0
+    for i in range(1, n+1):
+        res += number0f2s(i)
+    return res
+    #add code here

amazon/mirror_tree.cpp

@@ -0,0 +1,99 @@
+9{
+//Initial Template for C++
+#include <bits/stdc++.h>
+using namespace std;
+/* A binary tree node has data, pointer to left child
+   and a pointer to right child */
+struct Node
+{
+    int data;
+    struct Node* left;
+    struct Node* right;
+    
+    Node(int x){
+        data = x;
+        left = right = NULL;
+    }
+};
+void mirror(struct Node* node);
+/* Helper function to test mirror(). Given a binary
+   search tree, print out its data elements in
+   increasing sorted order.*/
+void inOrder(struct Node* node)
+{
+  if (node == NULL)
+    return;
+  inOrder(node->left);
+  printf("%d ", node->data);
+  inOrder(node->right);
+}
+/* Driver program to test size function*/
+int main()
+{
+  int t;
+  struct Node *child;
+  scanf("%d
+", &t);
+  while (t--)
+  {
+     map<int, Node*> m;
+     int n;
+     scanf("%d",&n);
+     struct Node *root = NULL;
+     while (n--)
+     {
+        Node *parent;
+        char lr;
+        int n1, n2;
+        scanf("%d %d %c", &n1, &n2, &lr);
+        if (m.find(n1) == m.end())
+        {
+           parent = new Node(n1);
+           m[n1] = parent;
+           if (root == NULL)
+             root = parent;
+        }
+        else
+           parent = m[n1];
+        child = new Node(n2);
+        if (lr == 'L')
+          parent->left = child;
+        else
+          parent->right = child;
+        m[n2]  = child;
+     }
+     mirror(root);
+     inOrder(root);
+     cout << endl;
+  }
+  return 0;
+}
+
+}
+/*This is a function problem.You only need to complete the function given below*/
+//function Template for C++
+/* A binary tree node has data, pointer to left child
+   and a pointer to right child /
+struct Node
+{
+    int data;
+    struct Node* left;
+    struct Node* right;
+    
+    Node(int x){
+        data = x;
+        left = right = NULL;
+    }
+}; */
+/* Should convert tree to its mirror */
+void mirror(Node* node) 
+{
+     // Your Code Here
+     if(node == NULL)return;
+     if(node->left == NULL && node->right == NULL) return;
+     mirror(node->left);
+     mirror(node->right);
+     Node *temp = node->left;
+     node->left = node->right;
+     node->right = temp;
+}