Below are the Binary Tree Traversal articles where you will learn how to traverse the binary tree using DFS (Inorder, Preorder and Postorder) and BFS (level order). These articles also explain the time and space complexity of the respective traversals.

• DFS (Depth First Search) Traversals:
  • Inorder Traversal: Visit left subtree, visit root and then visit the right subtree.
    • Iterative and Recursive
    • Inorder Iterator
  • Preorder Traversal: Visit root, visit left subtree and then visit the right subtree.
    • Iterative and Recursive
    • Preorder Iterator
  • Postorder Traversal: Visit left subtree, visit right subtree and then visit root.
    • Iterative and Recursive
    • Postorder Iterator
• BFS (Breadth First Search) Traversals:
  • Level order traversal: Traverse all nodes level by level.