- 註冊時間
- 2006-10-8
- 最後登錄
- 2019-6-20
- 主題
- 查看
- 積分
- 1306
- 閱讀權限
- 110
- 文章
- 1393
- 相冊
- 0
- 日誌
- 1
  
狀態︰
離線 
|
檔案：Tree.h
#ifndef TREE_H
#define TREE_H
#include "Array.h"
typedef struct {
char *type;
char *value;
Array* childs;
} Tree;
Tree* TreeNew(char *pType, char *pValue);
void TreeFree(Tree *tree);
void TreeAddChild(Tree *tree, Tree *child);
void TreePrint(Tree *tree);
#endif
檔案：Tree.c
#include <stdio.h>
#include "Tree.h"
Tree *TreeNew(char *type, char *value) {
ASSERT(type != NULL && value != NULL);
Tree *rzTree = ObjNew(Tree, 1);
rzTree->type = (void*) newStr(type);
rzTree->value = (void*) newStr(value);
rzTree->childs = NULL;
// printf("TreeNew(%s,%s)\n", type, value);
// printf("address of tree->type=%d, tree->value=%d\n", rzTree->type, rzTree->value);
return rzTree;
}
void TreeFree(Tree *tree) {
if (tree == NULL) return;
freeMemory(tree->type);
freeMemory(tree->value);
if (tree->childs != NULL) {
int i;
for (i=0; i<tree->childs->count; i++)
TreeFree(tree->childs->item[i]);
ArrayFree(tree->childs, NULL);
}
ObjFree(tree);
}
void TreeAddChild(Tree *tree, Tree *child) { // 在樹中加入一個新的子樹。
ASSERT(tree != NULL && child != NULL);
if (tree->childs == NULL)
tree->childs = ArrayNew(1);
ArrayAdd(tree->childs, child);
}
void TreePrintLevel(Tree *tree, int level) { // 將該樹列印出來。
ASSERT(tree != NULL && tree->type != NULL);
// printf("address of tree->type=%d, tree->value=%d\n", tree->type, tree->value);
printf("%s+%s\t = %s\n", strSpaces(level), tree->type, tree->value);
if (tree->childs != NULL) {
int i;
for (i=0; i<tree->childs->count; i++)
TreePrintLevel(tree->childs->item[i], level + 1);
printf("%s-%s\n", strSpaces(level), tree->type);
}
}
void TreePrint(Tree *tree) {
TreePrintLevel(tree, 0);
}
|
|
發表於 2012-7-11 00:22:26
