[LeetCode OJ] Binary Tree Preorder Traversal 解题报告
2014-08-28 06:09
447 查看
题目地址:https://oj.leetcode.com/problems/binary-tree-preorder-traversal/
题意:就是数的先序遍历
二叉树的遍历
· Preorder前序遍历——访问结点的操作发生在遍历其左右子树之前
· Inorder中序遍历——访问结点的操作发生在遍历其左右子树之间
· Postorder后序遍历——访问结点的操作发生在遍历其左右子树之后
· Level order层次遍历——按每一层的节点,从左到右逐次访问
题意:就是数的先序遍历
二叉树的遍历
· Preorder前序遍历——访问结点的操作发生在遍历其左右子树之前
· Inorder中序遍历——访问结点的操作发生在遍历其左右子树之间
· Postorder后序遍历——访问结点的操作发生在遍历其左右子树之后
· Level order层次遍历——按每一层的节点,从左到右逐次访问
/* * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(x), left(NULL), right(NULL) {} * }; */ class Solution { vector<int> vec; public: vector<int> preorderTraversal(TreeNode *root) { dfs(root); return vec; } void dfs(TreeNode *root){ if(!root) return; vec.push_back(root->val); dfs(root->left); dfs(root->right); } };
相关文章推荐
- LeetCode—Binary Tree Preorder Traversal 解题报告
- 剑指offer 面试题6:重建二叉树(Leetcode105. Construct Binary Tree from Preorder and Inorder Traversal) 解题报告
- Leetcode 105. Construct Binary Tree from Preorder and Inorder Traversal 先序和中序中恢复二叉树 解题报告
- LeetCode 解题报告 Binary Tree Preorder Traversal
- [LeetCode OJ] Binary Tree Postorder Traversal 解题报告
- 【LeetCode】Binary Tree Preorder Traversal 解题报告
- 【LeetCode】144 . Binary Tree Preorder Traversal 解题报告
- 【LeetCode】105. Construct Binary Tree from Preorder and Inorder Traversal 解题报告
- [leetcode] 105. Construct Binary Tree from Preorder and Inorder Traversal 解题报告
- 【LeetCode】Construct Binary Tree from Preorder and Inorder Traversal 解题报告
- [leetcode]105. Construct Binary Tree from Preorder and Inorder Traversal@Java解题报告
- LeetCode: Construct Binary Tree from Preorder and Inorder Traversal 解题报告
- [Leetcode] 105. Construct Binary Tree from Preorder and Inorder Traversal 解题报告
- Construct Binary Tree from Preorder and Inorder Traversal 解题报告
- leecode 解题总结:105. Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode OJ 105. Construct Binary Tree from Preorder and Inorder Traversal
- [LeetCode]Binary Tree Postorder Traversal,解题报告
- 【LeetCode OJ】Construct Binary Tree from Preorder and Inorder Traversal
- LeetCode—Binary Tree Postorder Traversal 解题报告
- LeetCode OJ:Binary Tree Preorder Traversal