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

Solution: Binary Tree Preorder Traversal

Explore the Morris traversal method for binary tree preorder traversal. This lesson helps you understand how to traverse nodes in root-left-right order using depth-first search without extra space, improving your ability to implement efficient tree algorithms.

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