Binary-Tree

Traverse a binary tree in inorder (left -> root -> right)

Traverse a binary tree in preorder (root -> left -> right)

Traverse the boundary of a binary tree in anti-clockwise direction.

Construct a binary tree from preorder and inorder traversal sequences.

Count the number of nodes in a binary tree where the path from root to that node has no nodes with values greater than the current node.

Find the diameter (longest path) of a binary tree.

Flatten a binary tree into a linked list in-place using preorder traversal.

Invert (mirror) a binary tree by swapping left and right children

Find the maximum depth (height) of a binary tree

Traverse binary tree in postorder (left, right, root)

Print all root-to-leaf paths in a binary tree

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

Traverse a binary tree vertically and return nodes by columns

Traverse a binary tree level by level in zigzag order