Series

Latest Posts

2025-10-23 2 min read

Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X.

2025-10-14 2 min read

Find the right side view of a binary tree, with step-by-step explanation and code examples in Python.

2025-10-13 2 min read

Find the lowest common ancestor of two nodes in a binary search tree, with step-by-step explanation and code examples in Python.