[LeetCode]144.Binary Tree Preorder Traversal

【题目】 Given a binary tree, return thepreordertraversal of its nodes' values. For example: Given binary tree{1,#,2,3}, 1 \ 2 / 3 return[1,2,3]. Note:Recursive solution is trivial, co
相关文章
相关标签/搜索