Binary Tree Traversals

O(n)
n = size(tree)

Python - DFS

 
Previous
Previous

Binary Search

Next
Next

Matrix Traversals