Tree

Traverse a binary tree level by level from left to right.

Find the lowest common ancestor of two nodes in a binary tree.

Find the maximum path sum in a binary tree.

Check if there exists a root-to-leaf path with given sum.

Serialize a binary tree to a string and deserialize it back to the original tree

Check if a binary tree is symmetric around its center.

Traverse a binary tree vertically and return nodes by columns

Traverse a binary tree level by level in zigzag order