[C++]LeetCode: 95 Binary Tree Preorder Traversal (先序遍历)
2015-01-14 19:43
405 查看
题目:
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree
return
Note: Recursive solution is trivial, could you do it iteratively?
Answer 1: 递归法
思路:如果当前节点不为空,先把当前节点的值放入数组。从树的根结点开始,再先序遍历左子树和右子树,最后返回数组。迭代终止条件,如果当前节点为空,则返回数组。
AC Code:
Answer 2: 非递归法
思路:使用栈的非递归算法。先用根结点初始化栈,然后在栈不为空时,循环做以下操作,然后访问栈顶节点,接下来依次把栈顶节点的右结点和栈顶节点的左结点压栈(注意次序 ,先右结点,后左结点,一定不能反),因为先序遍历是先访问左子树,后访问右子树。
AC Code:
Given a binary tree, return the preorder traversal of its nodes' values.
For example:
Given binary tree
{1,#,2,3},
1 \ 2 / 3
return
[1,2,3].
Note: Recursive solution is trivial, could you do it iteratively?
Answer 1: 递归法
思路:如果当前节点不为空,先把当前节点的值放入数组。从树的根结点开始,再先序遍历左子树和右子树,最后返回数组。迭代终止条件,如果当前节点为空,则返回数组。
AC Code:
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: vector<int> preorderTraversal(TreeNode *root) { if(root == NULL) return Vpreorder; Vpreorder.push_back(root->val); preorderTraversal(root->left); preorderTraversal(root->right); return Vpreorder; } private: vector<int> Vpreorder; };
Answer 2: 非递归法
思路:使用栈的非递归算法。先用根结点初始化栈,然后在栈不为空时,循环做以下操作,然后访问栈顶节点,接下来依次把栈顶节点的右结点和栈顶节点的左结点压栈(注意次序 ,先右结点,后左结点,一定不能反),因为先序遍历是先访问左子树,后访问右子树。
AC Code:
/** * Definition for binary tree * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { public: vector<int> preorderTraversal(TreeNode *root) { vector<int> ret; if(root == NULL) return ret; stack<TreeNode*> stk; stk.push(root); while(!stk.empty()) { TreeNode* node = stk.top(); stk.pop(); ret.push_back(node->val); //次序不能反,一定要先压入右结点,再压入左结点 if(node->right) stk.push(node->right); if(node->left) stk.push(node->left); } return ret; } };
相关文章推荐
- LeetCode 144 Binary Tree Preorder Traversal (先序遍历二叉树)
- LeetCode:Binary Tree Preorder Traversal(二叉树的先序遍历)
- leetcode_middle_95_105. Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode 105. Construct Binary Tree from Preorder and Ignorer Traversal(C++版)
- [LeetCode] Binary Tree Preorder Traversal 二叉树的先序遍历
- C++详解Leetcode:105. Construct Binary Tree from Preorder and Inorder Traversal
- 【C++】【LeetCode】105. Construct Binary Tree from Preorder and Inorder Traversal
- Leetcode_c++:Construct Binary Tree from Preorder and Inorder Traversal(105)
- 【leetcode 先序遍历】Binary Tree Preorder Traversal
- [leetcode-144]Binary Tree Preorder Traversal(c++)
- leetcode 题解:Binary Tree Preorder Traversal (二叉树的先序遍历)
- [LeetCode] Binary Tree Preorder Traversal (非递归的先序遍历)
- Leetcode Binary Tree Preorder Traversal 二叉树先序遍历
- [leetcode] Binary Tree Preorder Traversal 非递归先序遍历
- leetcode 144 Binary Tree Preorder Traversal C++
- 【LeetCode-144】Binary Tree Preorder Traversal(C++)
- leetcode:Binary Tree Preorder Traversal 先序遍历
- leetcode_c++:栈:Binary Tree Preorder Traversal(144)
- LeetCode 144 — Binary Tree Preorder Traversal(C++ Java Python)
- [C++]LeetCode: 37 Construct Binary Tree from Preorder and Inorder Traversal