思路: preorder用栈两三下就写完了 1vector<int> preorderTraversal(TreeNode *root) {2vector<int>nodes;3if(root == NULL)returnnodes;4stack<TreeNode *>tStack;5tStack.push(root);6while(!tStack.empty()){7TreeNode *top =tStack.top();8nodes.push_back(top->val);9tStack.pop();10if(top-...
View Luffy27's solution of Binary Tree Inorder Traversal on LeetCode, the world's largest programming community.