--- a/baum.c	Thu Feb 07 14:46:27 2008 +0100
+++ b/baum.c	Thu Feb 07 16:15:07 2008 +0100
@@ -24,17 +24,38 @@
 
 
 /* new */
-struct Node* newNode(char* name) {
+struct Node* newNode(char* name, unsigned char value) {
 	struct Node* node;
 	node = (struct Node*) malloc(sizeof(struct Node));
 	node->name = name;
-	node->value = 0;
+	node->value = value;
 	node->right = 0;
 	node->down = 0;
 	return node;
 }
 
 
+void setValue(struct Node* node, unsigned char value) {
+	node->value = value;
+}
+
+
+struct Node* nextNode(struct Node* node) {
+	return node->right;
+}
+
+struct Node* lastNode(struct Node* node) {
+	while (node->right != NULL) {
+		node = node->right;
+	}
+	return node;
+}
+
+void insertLast(struct Node* node, struct Node* insert) {
+	node = lastNode(node);
+	node->right = insert;
+}
+
 /* delete */
 void delete(struct Node* node) {
 	if (node->down != NULL) {
@@ -78,14 +99,25 @@
 
 /* init */
 void init() {
-	root = newNode("printchar");
-	root->down = newNode("number");
-	root->down = newNode("sum");
-	root->down->down = newNode("number");
-	root->down->down->value = 70;  /* 'F' */
-	root->down->down->right = newNode("number");
-	root->down->down->right->value = 50;  /* '2' */
-	/* result should be 'x' */
+	/* add some numbers
+	root = newNode("print", 0);
+	root->down = newNode("sum", 0);
+
+	root->down->down = newNode("number", 60);
+
+	root->down->down->right = newNode("number", 50);
+
+	root->down->down->right->right = newNode("sum", 0);
+	root->down->down->right->right->down = newNode("number", 1);
+	root->down->down->right->right->down->right = newNode("number", 5);
+	*/
+
+	/* input numbers and add them */
+	root = newNode("print", 0);
+	root->down = newNode("sum", 0);
+	root->down->down = newNode("input", 0);
+	root->down->down->right = newNode("input", 0);
+	root->down->down->right->right = newNode("input", 0);
 }
 
 
@@ -96,6 +128,7 @@
 
 	action(root);
 
+	printTree(root);
 	delete(root);
 	
 	return(0);