baum
annotate 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 |
rev | line source |
---|---|
meillo@2 | 1 |
meillo@2 | 2 void logit(char* text); |
meillo@2 | 3 |
meillo@3 | 4 struct Node* newNode(char* name, unsigned char value); |
meillo@3 | 5 void setValue(struct Node* node, unsigned char value); |
meillo@3 | 6 void delete(struct Node* node); |
meillo@3 | 7 void printNode(struct Node* node); |
meillo@3 | 8 void printTree(struct Node* root); |
meillo@3 | 9 void traverse(struct Node* root); |
meillo@3 | 10 |
meillo@3 | 11 struct Node* nextNode(struct Node* node); |
meillo@3 | 12 struct Node* lastNode(struct Node* node); |
meillo@15 | 13 struct Node* insertLast(struct Node* node, struct Node* insert); |
meillo@2 | 14 |
meillo@2 | 15 |
meillo@1 | 16 struct Node { |
meillo@9 | 17 char name[256]; |
meillo@3 | 18 unsigned char value; |
meillo@1 | 19 struct Node* down; |
meillo@1 | 20 struct Node* right; |
meillo@1 | 21 }; |
meillo@1 | 22 |
meillo@1 | 23 |
meillo@10 | 24 struct Stackitem { |
meillo@9 | 25 struct Node* node; |
meillo@10 | 26 struct Stackitem* next; |
meillo@9 | 27 }; |