lintcode.66 二叉树前序遍历

【lintcode.66 二叉树前序遍历】的更多相关文章

lintcode.66 二叉树前序遍历

二叉树的前序遍历描述笔记数据评测给出一棵二叉树,返回其节点值的前序遍历. 您在真实的面试中是否遇到过这个题? Yes 样例给出一棵二叉树 {1,#,2,3}, 1 \ 2 / 3 返回 [1,2,3]. /** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; *…

[LeetCode]144. Binary Tree Preorder Traversal二叉树前序遍历

关于二叉树的遍历请看: http://www.cnblogs.com/stAr-1/p/7058262.html /* 考察基本功的一道题,迭代实现二叉树前序遍历 */ public List<Integer> preorderTraversal(TreeNode root) { List<Integer> res = new ArrayList<>(); if (root==null) return res; Stack<TreeNode> stack =…

lintcode 二叉树前序遍历

二叉树的前序遍历给出一棵二叉树,返回其节点值的前序遍历. 您在真实的面试中是否遇到过这个题? Yes 样例给出一棵二叉树 {1,#,2,3}, 1 \ 2 / 3 返回 [1,2,3]. /** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left…

LintCode_69 二叉树前序遍历

题目给出一棵二叉树,返回其节点值的前序遍历. 和中序遍历基本相同 C++代码 vector<int> preorderTraversal(TreeNode *root) { // write your code here vector<int> vec; stack<TreeNode*> s; TreeNode* p = root; while (p || !s.empty()) { while (p) { vec.push_back(p->val); s.pu…

binTreepreorderTraversal二叉树前序遍历

原题 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]. 分析对二叉树进行先序遍历,即根节点->左子树->右子树代码: 递归: 递归代码十分简单,建立一个vector作为返回的结果,现将根节点push进去,然后递归处理左子树和右子树. class Solution…

[Leetcode 144]二叉树前序遍历Binary Tree Preorder Traversal

[题目] Given a binary tree, return the preordertraversal of its nodes' values. Example: Input: [1,null,2,3] 1 \ 2 / 3 Output: [1,2,3] [思路] 有参考,好机智,使用堆栈压入右子树,暂时存储. 左子树遍历完成后遍历右子树. [代码] /** * Definition for a binary tree node. * public class TreeNode { *…

144. Binary Tree Preorder Traversal (二叉树前序遍历)

Given a binary tree, return the preorder traversal of its nodes' values. For example:Given binary tree [1,null,2,3], 1 \ 2 / 3 return [1,2,3]. Note: Recursive solution is trivial, could you do it iteratively? 递归 : class Solution { private List<Intege…