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

Solution: Binary Tree Preorder Traversal

Explore how to perform binary tree preorder traversal efficiently using Morris traversal, a depth-first search algorithm that avoids recursion and extra stack space by temporarily modifying tree pointers. Understand how to visit nodes in root-left-right order, optimize space usage, and restore the tree structure after traversal.

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