Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Python

Solution: Binary Tree Preorder Traversal

Explore how to implement a binary tree preorder traversal using depth-first search without recursion or extra space. Understand the Morris traversal technique to temporarily reuse tree pointers, enabling efficient traversal and restoring the tree structure afterward.

We'll cover the following...

Statement

Given the root of a binary tree, your task is to return a list containing the values of its nodes in preorder traversalIn preorder traversal, we visit each node by first visiting the current node, then its left subtree, and finally its right subtree order.

Constraints:

  • The number of nodes in the tree is in the range [0,100] ...