/* Code Comments */3 posts tagged with "dfs"
binary traversal: preorder, postorder, and inorder
2022-11-28
|~3 min read
|533 words
There are three standard ways to traverse a binary tree when traversing depth first: Inorder (left, root, right) Preorder (root, left, right…
algorithms: depth first search (dfs)
2022-11-28
|~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
2022-11-28
|~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…