LeetCode：144_Binary Tree Preorder Traversal | 二叉树的前序遍历

题目：Binary Tree Preorder Traversal

二叉树的前序遍历，同样使用栈来解，代码如下：

 1 struct TreeNode {
 2     int            val;
 3     TreeNode*    left;
 4     TreeNode*    right;
 5     TreeNode(int x): val(x), left(NULL),right(NULL) {}
 6 };
 7
 8 vector<int> preorderTraversal(TreeNode *root) //非递归的前序遍历(用栈实现)
 9 {
10     if (NULL == root) {
11         cout << "tree is empty!" << endl;
12         exit(0);
13     }
14
15     TreeNode *pre = root;
16     //TreeNode *pTemp = pre;
17     stack<TreeNode *> tree_stack;
18     vector<int> tree_vector;
19
20     tree_stack.push(pre);
21     while (!tree_stack.empty()) {
22         TreeNode *pTemp = tree_stack.top();
23         tree_stack.pop();
24
25         tree_vector.push_back(pTemp->val);
26         if (pTemp->right != NULL)
27             tree_stack.push(pTemp->right);
28         if (pTemp->left != NULL)
29             tree_stack.push(pTemp->left);
30     }
31     return tree_vector;
32 }

LeetCode：144_Binary Tree Preorder Traversal | 二叉树的前序遍历 | Medium相关推荐

LeetCode Binary Tree Preorder Traversal(二叉树的前序遍历)
问题:给出一个二叉树,输出前序遍历思路: 自顶向下遍历过程中,将当前结点的值加入到list中,然后处理左.右子树具体代码参考: https://github.com/wuli2496/OJ/tre ...
144. Binary Tree Preorder Traversal 二叉树的前序遍历
给定一个二叉树,返回它的前序遍历. 示例: 输入: [1,null,2,3] 1\2/3 输出: [1,2,3] 进阶: 递归算法很简单,你可以通过迭代算法完成吗? "> 给定一 ...
[LeetCode] Binary Tree Postorder Traversal 二叉树的后序遍历
Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary ...
[leetcode] Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary t ...
Leetcode589.N-ary Tree Preorder TraversalN叉树的前序遍历
给定一个 N 叉树,返回其节点值的前序遍历. class Node { public:int val;vector<Node*> children;Node() {}Node(int _v ...
【二叉树迭代版前序遍历】LeetCode 144. Binary Tree Preorder Traversal
LeetCode 144. Binary Tree Preorder Traversal Solution1:递归版二叉树的前序遍历递归版是很简单的,前序遍历的迭代版相对是最容易理解的. 迭代版链接 ...
14 二叉树的前序遍历（Binary Tree Preorder Traversal）
文章目录 1 题目 2 描述 3 解决方案 3.1 递归算法 3.1.1 遍历法(Traverse) 思路源码 3.1.2 分治法(Devide And Conquer) 思路源码 3.2 非递归 ...
leetcode 331. Verify Preorder Serialization of a Binary Tree | 331. 验证二叉树的前序序列化（栈解法）
题目 https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/ 题解看了答案,参考:拍案叫绝的两种解 ...
leetcode 144. Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary t ...

LeetCode：144_Binary Tree Preorder Traversal | 二叉树的前序遍历 | Medium

LeetCode：144_Binary Tree Preorder Traversal | 二叉树的前序遍历 | Medium相关推荐

最新文章

热门文章