你即將離開本站

並前往https://leetcode.com/problems/binary-tree-preorder-traversal/

Binary Tree Preorder Traversal - LeetCode

Given the root of a binary tree, return the preorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1,2,3]. Example 2:

確定！ 回上一頁

查詢 「Preorder traversal」的人也找了：

  1. preorder traversal中文
    2.
  2. Iterative preorder traversal
    3.
  3. Level order traversal
    4.
  4. Construct binary Search Tree from preorder traversal
    5.
  5. Level order traversal 中文
    6.
  6. Binary tree postorder traversal
    7.
  7. 144. binary tree preorder traversal
    8.
  8. Preorder traversal Iterative
    9.