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

Solution: Binary Tree Preorder Traversal

Explore how to implement a binary tree preorder traversal using the Morris traversal technique. Learn to visit nodes in root-left-right order with O(1) space complexity by reusing the tree's pointers, avoiding recursion or auxiliary stacks while maintaining linear time complexity.

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