Skip to content

Commit fd89881

Browse files
trekhlebtrekhleb
committedApr 25, 2018
Add BFS and DFS for tree.
1 parent 8558576 commit fd89881

File tree

4 files changed

+12
-4
lines changed

4 files changed

+12
-4
lines changed
 

‎src/algorithms/graph/breadth-first-search/README.md

+3-1
Original file line numberDiff line numberDiff line change
@@ -10,4 +10,6 @@ nodes first, before moving to the next level neighbors.
1010

1111
## References
1212

13-
[Wikipedia](https://en.wikipedia.org/wiki/Breadth-first_search)
13+
- [Wikipedia](https://en.wikipedia.org/wiki/Breadth-first_search)
14+
- [Tree Traversals (Inorder, Preorder and Postorder)](https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/)
15+
- [BFS vs DFS](https://www.geeksforgeeks.org/bfs-vs-dfs-binary-tree/)

‎src/algorithms/graph/depth-first-search/README.md

+3-1
Original file line numberDiff line numberDiff line change
@@ -10,4 +10,6 @@ along each branch before backtracking.
1010

1111
## References
1212

13-
[Wikipedia](https://en.wikipedia.org/wiki/Depth-first_search)
13+
- [Wikipedia](https://en.wikipedia.org/wiki/Depth-first_search)
14+
- [Tree Traversals (Inorder, Preorder and Postorder)](https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/)
15+
- [BFS vs DFS](https://www.geeksforgeeks.org/bfs-vs-dfs-binary-tree/)

‎src/algorithms/tree/breadth-first-search/README.md

+3-1
Original file line numberDiff line numberDiff line change
@@ -10,4 +10,6 @@ nodes first, before moving to the next level neighbors.
1010

1111
## References
1212

13-
[Wikipedia](https://en.wikipedia.org/wiki/Breadth-first_search)
13+
- [Wikipedia](https://en.wikipedia.org/wiki/Breadth-first_search)
14+
- [Tree Traversals (Inorder, Preorder and Postorder)](https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/)
15+
- [BFS vs DFS](https://www.geeksforgeeks.org/bfs-vs-dfs-binary-tree/)

‎src/algorithms/tree/depth-first-search/README.md

+3-1
Original file line numberDiff line numberDiff line change
@@ -10,4 +10,6 @@ along each branch before backtracking.
1010

1111
## References
1212

13-
[Wikipedia](https://en.wikipedia.org/wiki/Depth-first_search)
13+
- [Wikipedia](https://en.wikipedia.org/wiki/Depth-first_search)
14+
- [Tree Traversals (Inorder, Preorder and Postorder)](https://www.geeksforgeeks.org/tree-traversals-inorder-preorder-and-postorder/)
15+
- [BFS vs DFS](https://www.geeksforgeeks.org/bfs-vs-dfs-binary-tree/)

0 commit comments

Comments
 (0)
Please sign in to comment.