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

Solution: Binary Tree Preorder Traversal

Explore how to implement binary tree preorder traversal with an emphasis on space efficiency using Morris traversal. Understand the method of reusing tree pointers to perform depth-first search without recursion or stack, and learn how to restore the tree structure while recording node values in preorder sequence.

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 ...