Merge branch 'master' into master

Author: vidit2512

binary_search_tree/Mirror_of_Binary_Search_Tree.java

@@ -0,0 +1,87 @@
+package Binarytree;
+
+
+import java.util.Scanner;
+
+class Node{
+int data;
+Node left;
+Node right;
+    Node(int element)
+    {
+    this.data = element;
+    this.left = this.right = null;
+    }
+}
+
+class BST_mirror{
+    Node root;
+    BST_mirror()
+    {
+        root = null;
+    }
+    void addNode(int element)
+    {
+        root = add(root,element);
+    }
+    Node add(Node node, int element)
+    {
+        if(node == null)
+            return new Node(element);
+        if(element<=node.data)
+            node.left = add(node.left,element);
+        else
+        if(element>node.data)
+            node.right = add(node.right,element);
+
+        return node;
+    }
+
+
+    void inorder(Node root)
+    {
+        if(root == null)
+            return;
+        inorder(root.left);
+        System.out.print(root.data+" ");
+        inorder(root.right);
+    }
+    Node mirror()
+    {
+        return mirrorify(root);
+    }
+    Node mirrorify(Node node)
+    {
+        if(node == null)
+            return null;
+        // now in each step we have to create a new node and replace left right elem of old root node with new node's right left
+        Node mirror_temp = new Node(node.data);
+        mirror_temp.left = mirrorify(node.right);
+        mirror_temp.right = mirrorify(node.left);
+        return mirror_temp;
+    }
+}
+
+public class mirror_Tree {
+    public static void main(String[] args) {
+        Scanner s = new Scanner(System.in);
+        BST_mirror obj = new BST_mirror();
+
+        obj.addNode(9);
+        obj.addNode(6);
+        obj.addNode(8);
+        obj.addNode(7);
+        obj.addNode(13);
+        obj.addNode(17);
+        obj.addNode(19);
+        System.out.println("Inorder of original Tree");
+        obj.inorder(obj.root);
+
+        System.out.println();
+        System.out.println("Inorder of original Tree");
+        Node mirror_node;
+        mirror_node = obj.mirror();
+        obj.inorder(mirror_node);
+
+    }
+}

breadth_first_traversal/breadth_first_traversal.cpp

@@ -0,0 +1,71 @@
+//@ raunak kumar jaiswal
+
+#include <bits/stdc++.h>
+using namespace std;
+
+void bfstraversal(vector<vector<int>>& g,  vector<bool>& visited, vector<int>& ans, int node)
+{
+    queue<int>qq;
+    qq.push(node);
+    visited[node] = true;
+    while(!qq.empty())
+    {
+        auto it = qq.front();
+        qq.pop();
+        for(auto itt : g[it])
+        {
+            if(visited[itt]==false)
+            {
+                visited[itt] = true;
+                qq.push(itt);
+            }
+        }
+        ans.push_back(it);
+    }
+
+}
+
+void makegraph( vector<vector<int>>& g, int num_edge)
+{
+  for(int i=0;i<num_edge;i++)
+  {
+      int a,b;
+      cin>>a>>b;
+      g[a].push_back(b); 
+      g[b].push_back(a);
+  }
+}
+
+int main()
+{
+    vector<vector<int>>g;
+    vector<bool>visited;
+    int num_node , num_edge;
+    cout<<"Enter number of Node"<<endl;
+    cin>>num_node;
+    cout<<"Enter number of Edges"<<endl;
+    cin>>num_edge;
+
+    g.assign(num_node,vector<int>());
+    visited.assign(num_node, false);
+
+cout<<"Enter the edges between vertex"<<endl;
+    makegraph(g,num_edge);
+
+    vector<int>ans;
+
+    for (int i=0;i<num_node;i++)
+    {
+       if(visited[i]==false)
+       bfstraversal(g,visited, ans, i);
+    }
+cout<<"----- Traversal output---"<<endl;
+    for(auto it: ans)
+    {
+        cout<<it<<" ";
+    }
+    
+
+
+
+}