LeetCode --- 144. Binary Tree Preorder Traversal 解题思路
Posted 杨鑫newlfe
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了LeetCode --- 144. Binary Tree Preorder Traversal 解题思路相关的知识，希望对你有一定的参考价值。
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:
Input: root = [] Output: []
Example 3:
Input: root = [1] Output: [1]
Example 4:
Input: root = [1,2] Output: [1,2]
Example 5:
Input: root &
以上是关于LeetCode --- 144. Binary Tree Preorder Traversal 解题思路的主要内容，如果未能解决你的问题，请参考以下文章
LeetCode 144. Binary Tree Preorder Traversal
[leetcode-144-Binary Tree Preorder Traversal]
LeetCode-144-Binary Tree Preorder Traversal
leetcode [144]Binary Tree Preorder Traversal