Binary Tree Traversal (7 Qs)

Series of problems related to "Binary Tree Traversal"

We could solve these problems iteratively using the same technique, Stack/Queue.

For solving inorder and postorder traversal iteratively, we need to store extra information "Visited Status".

For level order, we need to use Queue instead of Stack.

Related problems (follow the order to solve each problem):

• 0144. Binary Tree Preorder Traversal

• 0145. Binary Tree Postorder Traversal

• 0094. Binary Tree Inorder Traversal

• 0102. Binary Tree Level Order Traversal

  • 0104. Maximum Depth of Binary Tree

  • 1302. Deepest Leaves Sum

  • 0993. Cousins in Binary Tree

Summary of Traversal Types:

Binary Tree Traversal Summary