问题一:不分行从上到下打印二叉树
从上往下打印出二叉树的每个节点,同层节点从左至右打印。
源码:
用一个队列就可以解决。
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};*/
class Solution {
public:
vector<int> PrintFromTopToBottom(TreeNode* root) {
vector<int> result;
if(!root) return result;
queue<TreeNode*> st;
st.push(root);
while(!st.empty()){
TreeNode *tmp;
tmp = st.front();
result.push_back(tmp->val);
if(tmp->left) st.push(tmp->left);
if(tmp->right) st.push(tmp->right);
st.pop();
}
return result;
}
};
问题二:分行从上到下打印二叉树
从上到下按层打印二叉树,同一层结点从左至右输出。每一层输出一行。
源码:
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
vector<vector<int> > Print(TreeNode* pRoot) {
vector< vector<int>> result;
if(!pRoot) return result;
vector<int> tmp;
queue<TreeNode*> TreeQue;
TreeQue.push(pRoot);
int nextlevel=0, tobehind=1;
while(!TreeQue.empty()){
TreeNode* pNode = TreeQue.front();
tmp.push_back(pNode->val);
TreeQue.pop();
if(pNode->left){
TreeQue.push(pNode->left);
nextlevel++;
}
if(pNode->right){
TreeQue.push(pNode->right);
nextlevel++;
}
--tobehind;
if(tobehind == 0){
result.push_back(tmp);
vector <int>().swap(tmp);
tobehind = nextlevel;
nextlevel = 0;
}
}
return result;
}
};
问题三:之字形打印二叉树
请实现一个函数按照之字形打印二叉树,即第一行按照从左到右的顺序打印,第二层按照从右至左的顺序打印,第三行按照从左到右的顺序打印,其他行以此类推。
源码:
/*
struct TreeNode {
int val;
struct TreeNode *left;
struct TreeNode *right;
TreeNode(int x) :
val(x), left(NULL), right(NULL) {
}
};
*/
class Solution {
public:
vector<vector<int> > Print(TreeNode* pRoot) {
vector< vector<int>> result;
if(!pRoot) return result;
vector<int> tmp;
stack<TreeNode*> levels[2];
int cur=0, next=1;
levels[0].push(pRoot);
while(!levels[0].empty() || !levels[1].empty()){
TreeNode* pNode = levels[cur].top();
levels[cur].pop();
tmp.push_back(pNode->val);
if(cur == 0){
if(pNode->left)
levels[next].push(pNode->left);
if(pNode->right)
levels[next].push(pNode->right);
}
else{
if(pNode->right)
levels[next].push(pNode->right);
if(pNode->left)
levels[next].push(pNode->left);
}
if(levels[cur].empty()){
result.push_back(tmp);
vector<int>().swap(tmp);
cur = 1-cur;
next = 1-next;
}
}
return result;
}
};