144. Binary Tree Preorder Traversal

题目描述 Given a binary tree, return the preorder traversal of its nodes’ values. 方法思路 Approach1: 递归 recursive class Solution { //Runtime: 0 ms, faster than 100.00% //Memory Usage: 36.3 MB, less t
相关文章
相关标签/搜索