Today, let's talk about Linked List algorithms that are frequently used.

A Linked List is a data structure that stores data into a series of connected nodes, and thus it can be dynamically allocated. For each node, it contains 2 fields: the val that stores data, and the next that points to the next node.

Read More

Hi there, let's talk about how to nonrecursively do a In-Order traversal for a Binary Tree.

A Binary Tree consists of 3 parts: the node itself, pointer to the left child, pointer to the right child.

An In-Order Traversal is to access the leftmost child firstly, then the node itself, and finally the right child.

Read More