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

最新推荐文章于 2018-05-25 21:46:58 发布
最新推荐文章于 2018-05-25 21:46:58 发布
阅读量804 收藏
点赞数
分类专栏： leedcode
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/quickhead/article/details/62887549
版权
vector<int> tree::preorderTree(treeNode *root)
{
    vector<int> result;
    stack<treeNode*> tempStack;
    treeNode *dummyRootNode = root;//不知道root值是否会被改变 所以用这种方式 要测试一下
    if(dummyRootNode)
        tempStack.push(dummyRootNode);
    while(!tempStack.empty())
    {
        treeNode *tempNode = tempStack.top();
        tempStack.pop();
        result.push_back(tempNode->value);
        if(tempNode->rchild) tempStack.push(tempNode->rchild);
        if(tempNode->lchild) tempStack.push(tempNode->lchild);
    }
    return result;
}

LeetCode --- 144. Binary Tree Preorder Traversal 解题思路
杨鑫newlife的专栏
07-03 195
Given therootof a binary tree, returnthe preorder traversal of its nodes' values. Example 1: Input: root = [1,null,2,3] Output: [1,2,3] Example 2: Input: root = [] Output: [] Example 3: Input: root = [1] Output: [1] Example 4: Input...
算法系列——二叉树先序遍历(Binary Tree Preorder Traversal)
BridgeGeorge
08-22 1347
题目描述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 triv
Given preorder and inorder traversal of a tree, construct the binary tree.
yx2008302080的专栏
12-04 1616
题目：利用先序遍历和中序遍历，构造一个二叉树！ 例如： Inorder Traversal：{3,1,7,4,0,5,8,2,6}； Preorder Traversal：{0,1,3,4,7,2,5,8,6}; 思路： 先序遍历，第一个元素为根节点，以此元素把中序数组分成两个字数组，即为root的左右子树！
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right,...
07-03 186
class Solution { public: vector<vector<int>> levelOrder(TreeNode* root) { vector<vector<int>> res; if (root == NULL) {...
[LeetCode] Binary Tree Preorder Traversal
weixin_33738982的博客
02-24 121
Given a binary tree, return the preorder traversal of its nodes’ values. For example: Given binary tree {1,#,2,3}, return [3,2,1]. Note: Recursive solution is trivia...
LeetCode Given a binary tree, return the postorder traversal of its nodes' values.
yyywww666的专栏
04-28 3531
Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree{1,#,2,3}, 1 \ 2 / 3 return[3,2,1]. Note: Recursive solutio
Binary Tree Preorder Traversal
Bryan要加油
03-01 548
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 soluti
【LeetCode】145. Binary Tree Postorder Traversal 解题报告
crazy_jack
05-25 7057
转载请注明出处：http://blog.csdn.net/crazy1235/article/details/51471280Subject 出处：https://leetcode.com/problems/binary-tree-postorder-traversal/ Hard 级别 Given a binary tree, return the postorder travers
Assume the postorder of binary tree T is RELATIONDB, the in order of T is REILTABOND,then the preorder of T will be
最新发布
05-02
In an inorder traversal of a binary tree, the nodes to the left of the root correspond to the left subtree of the root, and the nodes to the right of the root correspond to the right subtree of the ...
《leetCode》：Binary Tree Preorder Traversal
wojiushimogui的博客
03-03 551
题目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, coul
【LeetCode】144 . Binary Tree Preorder Traversal 解题报告
crazy_jack
05-22 7118
转载请注明出处：http://blog.csdn.net/crazy1235/article/details/51471280Subject 出处：https://leetcode.com/problems/binary-tree-preorder-traversal/ Given a binary tree, return the preorder traversal of its node
LeetCode(144)Binary Tree Preorder Traversal
BUILD
01-15 2407
题目如下: 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
Binary Tree Level Order Traversal， 二叉树层级遍历
dddongdong的专栏
10-14 1203
[LeetCode]  Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree {3
Given a binary tree, return the postorder traversal of its nodes' values.
boguesfei的博客
05-25 250
For example:Given binary tree{1,#,2,3}, 1 \ 2 / 3 return[3,2,1].Note: Recursive solution is trivial, could you do it iteratively?递归方法/** * Definition for binary tree * public class T...
leetcode第47题（binary-tree-level-order-traversal）
u012338652的博客
02-09 273
题目： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level).  For example: Given binary tree{3,9,20,#,#,15,7},  3 / \
返回一个二维整数数组中最大联通子数组的和
weixin_30905133的博客
06-14 85
题目：返回一个二维整数数组中最大联通子数组的和。 要求：输入一个二维整形数组，数组里有正数也有负数。求所有子数组的和的最大值。 设计思想 先求出这个这个数组中的最大值，并定位，然后找出这个值周围的4个数，联通这4个数中的正数，若全为负数，则查找次大值，并与最大值联通，判断联通前与联通后值得大小，若变小则不联通最大值，若变大则联通最大值，以此类推，直到最大联通子数组怎么联通...
leetcode 之Binary Tree Level Order Traversal I和II 解题思路
笨鸟的专栏
07-11 2561
题目如下： Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, 3 / \
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值