Binary Tree Level Order Traversal
来源:互联网 发布:怎么在u盘中装ubuntu 编辑:程序博客网 时间:2024/06/09 23:52
Description:
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},
return its level order traversal as:
[
[3],
[9,20],
[15,7]
]
分析:
使用两个队列
代码:
#include <iostream>#include <queue>#include <vector>#define Elementype intusing namespace std;typedef struct TreeNode //树结点{ Elementype val; TreeNode *left; TreeNode *right; TreeNode(Elementype x) : val(x), left(nullptr), right(nullptr) {}} *Tree;int index = 0; //全局索引变量//使用先序遍历创建创建二叉树void MakeBinaryTree(Tree &T, Elementype value[]){ Elementype c = value[index++]; if (c == '#') T = nullptr; else { T = new TreeNode(c); MakeBinaryTree(T->left, value); MakeBinaryTree(T->right, value); }}//使用两个队列,一个队列用来存放当前level指针,另一个队列用来存储下一个将要访问的levelvector<vector<Elementype> > BinaryTreepostorderTraversal(Tree root){ queue<Tree> curQue, nextQue; vector<vector<Elementype> > result; vector<Elementype> level; Tree p = root; curQue.push(p); while (!curQue.empty()) { p = curQue.front(); level.push_back(p->val); curQue.pop(); if (p->left != nullptr) nextQue.push(p->left); if (p->right != nullptr) nextQue.push(p->right); if (curQue.empty()) { result.push_back(level); level.clear(); swap(nextQue, curQue); } } return result;}int main(){ Tree T = nullptr; //注意,每个结点都要有值,注意这里的取值不要等于35,即# vector<vector<Elementype>> result; Elementype data[11] = {3, 9, '#', '#', 20, 15, '#', '#', 7, '#', '#'}; MakeBinaryTree(T, data); result = BinaryTreepostorderTraversal(T); cout << "[" << endl; for (auto &s : result) { cout << " ["; for (auto &t : s) cout << t << " "; cout << "],"<<endl; } cout <<"]"<< endl; system("pause"); return 0;}
测试:
0 0
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- Binary Tree Level Order Traversal
- 对Map集合的遍历
- 虚函数与多态性
- 哈夫曼树和哈夫曼编码
- Mybatis之实现分页
- SVD & PCA
- Binary Tree Level Order Traversal
- throw throws 区别
- HDU1022——Train Problem I(栈 stack)
- SGU 106 The equation(扩欧)
- UVA - 11039 Building designing
- 计算思维实践之路(五)
- 前端SEO
- YoMail批量删除邮件
- Android中CoordinatorLayout(协调布局)的使用