DFS Inorder

Category: Trees & BSTs

Difficulty: beginner

Description: Visit left, root, then right subtree

Time Complexity: O(n)

Space Complexity: O(h)

Related LeetCode Problems

• 94. Binary Tree Inorder Traversal (Easy)
• 98. Validate Binary Search Tree (Medium)
• 450. Delete Node in a BST (Medium)
• 230. Kth Smallest Element in a BST (Medium)
• 99. Recover Binary Search Tree (Hard)
• 173. Binary Search Tree Iterator (Medium)
• 701. Insert into a Binary Search Tree (Medium)
• 98. Validate Binary Search Tree (duplicate) (Medium)
• 108. Convert Sorted Array to Binary Search Tree (Easy)
• 109. Convert Sorted List to Binary Search Tree (Medium)
• 124. Binary Tree Maximum Path Sum (Hard)
• 99. Recover Binary Search Tree (duplicate) (Hard)