DFS Preorder

Category: Trees & BSTs

Difficulty: beginner

Description: Visit root, left, then right subtree

Time Complexity: O(n)

Space Complexity: O(h)

Related LeetCode Problems

• 144. Binary Tree Preorder Traversal (Easy)
• 94. Binary Tree Inorder Traversal (Easy)
• 100. Same Tree (Easy)
• 101. Symmetric Tree (Easy)
• 105. Construct Binary Tree from Preorder and Inorder Traversal (Medium)
• 106. Construct Binary Tree from Inorder and Postorder Traversal (Medium)
• 114. Flatten Binary Tree to Linked List (Medium)
• 1441. Build an Array With Stack Operations (Medium)
• 199. Binary Tree Right Side View (Medium)
• 107. Binary Tree Level Order Traversal II (Easy)
• 129. Sum Root to Leaf Numbers (Medium)
• 257. Binary Tree Paths (Easy)
• 124. Binary Tree Maximum Path Sum (Hard)
• 297. Serialize and Deserialize Binary Tree (Hard)