Two Pointer Problems (Part 2) - Sliding Window
Two pointers are used to scan in two directions during traversal, achieving the desired algorithmic goals.
Data Structures
Binary Tree Basics (Part 3) - Segment Tree
A binary tree is an ordered tree where each node has a maximum of two children. It is the simplest and most essential type of tree.
Binary Trees Basics (Part 2) - Binary Search Trees (BSTs)
A binary tree is a tree in which each node has at most two children, making it a simple yet fundamental tree structure.
Binary Trees Basics (Part 1) - Understanding Binary Trees
A binary tree is a fundamental type of tree structure where each node has at most two child nodes, making it one of the simplest and most important trees.
