剑指offer32

#include<iostream>
#include<queue>
using namespace std;

struct TreeNode {
	TreeNode* left;
	TreeNode* Right;
	double value;
};

void Print(TreeNode *t) {
	if (t == NULL) return;
	queue<TreeNode *> q;
	q.push(t);
	while (!q.empty()) {
		TreeNode* p = q.front();
		q.pop();
		if (p->left) q.push(p->left);
		if (p->Right) q.push(p->Right);
		cout << p->value;
	}
}

int main() {
	TreeNode* t = new TreeNode();
	t->value = 1;
	t->left = new TreeNode();
	t->left->value = 2;
	t->Right = new TreeNode();
	t->Right->value = 3;
	t->left->Right = new TreeNode();
	t->left->Right->value = 4;
	Print(t);
	return 0;
}