From 3a62a9e9c973066dac9fb0a0fe8f24963a309f5a Mon Sep 17 00:00:00 2001
From: Rishabh Kumar <52632726+rishabhk965@users.noreply.github.com>
Date: Wed, 13 Oct 2021 15:06:24 +0530
Subject: [PATCH] added DFS.cpp

---
 Data Structures/DFS.cpp | 56 +++++++++++++++++++++++++++++++++++++++++
 1 file changed, 56 insertions(+)
 create mode 100644 Data Structures/DFS.cpp

diff --git a/Data Structures/DFS.cpp b/Data Structures/DFS.cpp
new file mode 100644
index 0000000..a76684e
--- /dev/null
+++ b/Data Structures/DFS.cpp	
@@ -0,0 +1,56 @@
+#include<bits/stdc++.h>
+using namespace std;
+#define MAXSIZE 1000000
+
+vector<vector<int> > graph(MAXSIZE);
+bool vis[MAXSIZE];
+
+
+void dfs(int start)
+{
+	stack<int> s;
+	cout<<start<<" ";
+	vis[start]=true;
+	s.push(start);
+	while(!s.empty())
+	{
+		int first=s.top();
+		for(int i=0;i<graph[first].size();i++)
+		{
+			if(!vis[graph[first][i]])
+			{
+				cout<<graph[first][i]<<" ";
+				vis[graph[first][i]]=true;
+				s.push(graph[first][i]);
+				first=graph[first][i];
+				i=-1;
+			}
+		}
+		s.pop();
+	}
+}
+int main()
+{
+
+	int n,u,v;
+	cin>>n;
+	for(int i=0;i<n-1;i++)
+	{
+		cin>>u>>v;
+		graph[u].push_back(v);
+		graph[v].push_back(u);
+	}
+
+	//to check adjacency list
+	// for(int i=1;i<=n;i++)
+	// {
+	// 	cout<<i<<"-> ";
+	// 	for(int j=0;j<graph[i].size();j++)
+	// 		cout<<graph[i][j]<<" ";
+	// 	cout<<endl;
+	// }
+
+	//dfs code
+	dfs(1);
+	return 0;
+}