/* Code Comments */3 posts tagged with "dfs"
algorithms: depth first search (dfs)
2021-03-05
|~7 min read
|1245 words
When it comes to searching a tree, there are two general approaches: depth first and breadth first. This post will discuss the former and…
checking for validity of a binary search tree: depth first
2021-03-05
|~6 min read
|1137 words
A Binary Search Tree is a pretty ingenious data structure. One simple rule can help organize data in such a way as to make it rapidly…
checking for validity of a binary search tree: depth first
2021-03-05
|~6 min read
|1137 words
A Binary Search Tree is a pretty ingenious data structure. One simple rule can help organize data in such a way as to make it rapidly…