Depth first search

class Node {
  constructor(data) {
    this.left = null;
    this.right = null;
    this.data = data;
  }
}

// depth first search tree traversal using recursive
//static implementation
const depthFirstTraversal = (root) => {
  if (root === null) return [];
  const leftValues = depthFirstTraversal(root.left); //[2 , 4 , 5 ]
  const rightValues = depthFirstTraversal(root.right); // [3 , 6 , 7 ]
  return [root.data, ...leftValues, ...rightValues];
};
const one = new Node(1);
const two = new Node(2);
const three = new Node(3);
const four = new Node(4);
const five = new Node(5);
const six = new Node(6);
const seven = new Node(7);

one.left = two;
one.right = three;
two.left = four;
two.right = five;
three.left = six;
three.right = seven;
// console.log(depthFirstTraversal(one)); // [1 ,2 , 4 , 5  ,3 , 6 ,7]

// depth first search tree traversal using while loop :

const depthFirstTraversal2 = (root) => {
  if (root === null) return [];

  const result = [];
  const stack = [root];

  while (stack.length > 0) {
    const current = stack.pop();
    result.push(current.data);
    if (current.right) stack.push(current.right);
    if (current.left) stack.push(current.left);
  }
  return result;
};
console.log(depthFirstTraversal2(one)); // [1 ,2 , 4 , 5  ,3 , 6 ,7]

Source: grepper.com

Depth first search

const depthFirstTraversal = (root) => {
  if (root === null) return [];

  const result = [];
  const stack = [root];

  while (stack.length > 0) {
    const current = stack.pop();
    result.push(current.data);
    if (current.right) stack.push(current.right);
    if (current.left) stack.push(current.left);
  }
  return result;
};

Source: grepper.com

Depth first search

#include <bits/stdc++.h>
using namespace std;

class Graph {
public:
	map<int, bool> visited;
	map<int, list<int> > adj;
	void addEdge(int v, int w);
	void DFS(int v);
	void PrintGraph();
	
};

void Graph::addEdge(int v, int w)
{
	adj[v].push_back(w); 
}

void Graph::PrintGraph()
{
    for(auto &it:adj)
    {
        cout<<it.first<<" : ";
        for(auto i=(it.second).begin();i!=(it.second).end();i++)
        {
            cout<<*i<<" -> ";
        }
        cout<<"NULL\n";
    }    
}

void Graph::DFS(int v)
{
    visited[v]=true;
    cout<<v<<" ";
    for(auto i=adj[v].begin();i!=adj[v].end();i++)
    {
        if(!visited[*i])
        {
            DFS(*i);
        }
    }
}


int main()
{
	Graph g;
	g.addEdge(0, 1);
	g.addEdge(0, 2);
	g.addEdge(1, 2);
	g.addEdge(2, 0);
	g.addEdge(2, 3);
	g.addEdge(3, 3);
	g.PrintGraph();
	g.DFS(2);
	return 0;
}

Source: grepper.com

Similar codes

0 vote184 views1 answer
Turtule code for digital clock
Python
0 vote177 views1 answer
Stickler Thief or Maximum sum such that no two elements are adjacent
Python
0 vote133 views1 answer
Get the invite url of server disc.py
Python
0 vote89 views1 answer
Change state of tkintr btn
Python
4 votes136 views1 answer
How to save a neural network pytorch
Python
0 vote126 views1 answer
Raspberry pi push button function control python
Python
0 vote138 views1 answer
Python calander from Programmer of empires but updated
Python
0 vote127 views1 answer
Python turtle (built in shape) image size
Python
2 votes137 views1 answer
Standardize columns in pandas
Python
0 vote184 views1 answer
Isidentifier method in python
Python