LeetCode-144. Binary Tree Preorder Traversal

LeetCode-144. Binary Tree Preorder Traversal

Given a binary tree, return the preorder traversal of its nodes' values.

Example:

Input: ​​[1,null,2,3]​​ 1 \ 2 / 3 Output: ​​[1,2,3]​​

​​题解：​​

class Solution {public: vector preorderTraversal(TreeNode* root) { stack q; if (root == NULL) { return {}; } q.push(root); vector res; while (q.empty() == false) { TreeNode *t = q-(); q.pop(); res.push_back(t->val); if (t->right != NULL) { q.push(t->right); } if (t->left != NULL) { q.push(t->left); } } return res; }};

版权声明：本文内容由网络用户投稿，版权归原作者所有，本站不拥有其著作权，亦不承担相应法律责任。如果您发现本站中有涉嫌抄袭或描述失实的内容，请联系我们jiasou666@gmail.com 处理，核实后本网站将在24小时内删除侵权内容。