/* 3. ´ÙÀ½ ÇÁ·Î±×·¥ÀÇ Ãâ·ÂÀ» ½á¶ó. */

#include <stdio.h>

class TreeNode {
public:
	TreeNode *left;
	int data;
	TreeNode *right;
	TreeNode(int x) {
		left = this;
		data = x;
		right = this;
	}
	void traverse() {
		if (left != this) left->traverse();
		printf("%d\n",data);
		if (right != this) right->traverse();
	}
};

int number[5] = { 1, 2, 3, 4, 5 };

void main()
{
	TreeNode *n0 = new TreeNode(number[0]);
	TreeNode *n1 = new TreeNode(number[1]);
	TreeNode *n2 = new TreeNode(number[2]);
	TreeNode *n3 = new TreeNode(number[3]);
	TreeNode *n4 = new TreeNode(number[4]);

	n2->left = n3;
	n3->left = n4;
	n2->right = n1;
	n1->right = n0;
	n2->traverse();
}