###### Iterative Traversal for a Binary Tree

Problems There are three ways to traverse a binary tree: preorder, inorder and postorder. On Leetcode, there are three problems 144. Binary Tree Preorder Traversal Given a binary tree, return the preo

Read MoreProblems There are three ways to traverse a binary tree: preorder, inorder and postorder. On Leetcode, there are three problems 144. Binary Tree Preorder Traversal Given a binary tree, return the preo

Read MoreProblems There are three ways to traverse a binary tree: preorder, inorder and postorder. On Leetcode, there are three problems 144. Binary Tree Preorder Traversal Given a binary tree, return the preo

Read MoreDefinition What are Hash Tables? Hash Tables are key-value pairs key must be immutable Hash Function Hash functions convert the value to key One big challenge is to calculate the key more evenly

Read More