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

Solution: Binary Tree Preorder Traversal

Understand how to implement a space-efficient preorder traversal on a binary tree using the Morris traversal method. Learn to visit nodes without recursion or stacks by temporarily modifying pointers, ensuring all nodes are visited root-left-right, 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][0, 100].

  • −100≤-100 \leq ...