comparison baum.h @ 15:e2048e569891

insertLast returns now new inserted node; very dumb implementation for action_times
author meillo@marmaro.de
date Wed, 13 Feb 2008 09:57:07 +0100
parents 0e15841ae111
children f0856c177403
comparison
equal deleted inserted replaced
14:15e11eea1c66 15:e2048e569891
8 void printTree(struct Node* root); 8 void printTree(struct Node* root);
9 void traverse(struct Node* root); 9 void traverse(struct Node* root);
10 10
11 struct Node* nextNode(struct Node* node); 11 struct Node* nextNode(struct Node* node);
12 struct Node* lastNode(struct Node* node); 12 struct Node* lastNode(struct Node* node);
13 void insertLast(struct Node* node, struct Node* insert); 13 struct Node* insertLast(struct Node* node, struct Node* insert);
14 14
15 15
16 struct Node { 16 struct Node {
17 char name[256]; 17 char name[256];
18 unsigned char value; 18 unsigned char value;