/* Code Comments */3 posts tagged with "binary search tree"
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…
checking for validity of a binary search tree: breadth first
2022-11-28
|~2 min read
|389 words
Yesterday, I wrote about determining whether a Binary Search Tree was valid using a depth-first approach. I made an off-hand comment about…
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…