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/3Output: [1,2,3]

Follow up: Recursive solution is trivial, could you do it iteratively?

解题思路：先根非递归遍历。

    vector<int> preorderTraversal(TreeNode* root) {vector<int> results;stack<TreeNode*> stk;while(root!=nullptr || !stk.empty()){while(root!=nullptr){stk.push(root);results.push_back(root->val);root=root->left;}TreeNode* temp = stk.top();stk.pop();if(temp->right!=nullptr)root = temp->right;}return results;}

转载于:https://www.cnblogs.com/nobodywang/p/10353873.html

LeetCode-144-Binary Tree Preorder Traversal相关推荐

【二叉树迭代版前序遍历】LeetCode 144. Binary Tree Preorder Traversal
LeetCode 144. Binary Tree Preorder Traversal Solution1:递归版二叉树的前序遍历递归版是很简单的,前序遍历的迭代版相对是最容易理解的. 迭代版链接 ...
[Lintcode]66. Binary Tree Preorder Traversal/[Leetcode]144. Binary Tree Preorder Traversal
66. Binary Tree Preorder Traversal/144. Binary Tree Preorder Traversal 本题难度: Easy/Medium Topic: Bina ...
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 (层次遍历)
Given a binary tree, return the preorder traversal of its nodes' values. Example: Input: [1,null,2,3 ...
leetcode 144. Binary Tree Preorder Traversal ----- java
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary t ...
[LeetCode] 144. Binary Tree Preorder Traversal Java
题目: Given a binary tree, return the preorder traversal of its nodes' values. For example: Given bina ...
LeetCode 144. Binary Tree Preorder Traversal--二叉树前序遍历--反向压栈--迭代-栈，递归--C++,Python解法
题目地址:Binary Tree Preorder Traversal - LeetCode Given a binary tree, return the preorder traversal of ...
[LeetCode 题解]: Binary Tree Preorder Traversal
前言 [LeetCode 题解]系列传送门: http://www.cnblogs.com/double-win/category/573499.html 1.题目描述 Given a binary ...
144. Binary Tree Preorder Traversal（非递归实现二叉树的前序遍历）
Given a binary tree, return the preorder traversal of its nodes' values. Example: Input: [1,null,2,3 ...
栈和递归的关系 144:Binary Tree Preorder Traversal
前序遍历:根左右 //用栈来实现非递归解法/*** Definition for a binary tree node.* struct TreeNode {* int val;* TreeNode ...

LeetCode-144-Binary Tree Preorder Traversal

LeetCode-144-Binary Tree Preorder Traversal相关推荐

最新文章

热门文章