Data Structures & Algorithms

Record a method for determining whether a binary tree is balanced by comparing subtree heights and recursively checking both subtrees.

LeetCode notes on finding the lowest common ancestor in a binary tree.

Record recursive, stack-based, and queue-based methods for generating the mirror of a binary tree by swapping left and right subtrees.

LeetCode notes on calculating the diameter of a binary tree.

Record a queue-based method that uses end-of-line pointers to print a binary tree level by level, one line per level.

Notes on finding the lowest common ancestor of two nodes in a binary tree.

Record a zigzag traversal method by reversing alternating rows after level-order traversal.

LeetCode notes on merging two binary trees.

Record a preorder-recursive matching method for determining whether one binary tree is a substructure of another.

LeetCode notes on checking whether a binary tree is mirror-symmetric.