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

Solution: Binary Tree Preorder Traversal

Explore the Morris traversal method for binary tree preorder traversal that visits nodes in root-left-right order. Understand how to use tree pointers to avoid recursion and extra space, achieving O(n) time and O(1) space complexity while restoring the tree structure.

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