## Stack

## Dynamic Array

###### Dynamic Array

Dynamic Array In Array, I pre-defined the capacity The array’s size need to be smaller than its capacity Now I will define a dynamic array whose capacity will grow or shrink depending on array&

Read More## Array

## Iterative Traversal for a Binary Tree

###### 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 More## Preorder, Inorder and Postorder Traversal for a Binary Tree

###### Preorder, Inorder and Postorder 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 More## Hash Tables

###### Hash Tables

Definition 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