//pre order traversal, visit the parent the first
void PrintTreePreOrder (Node* node)
{
printf ("%d ", node->val);
if (node->left != 0)
PrintTreePreOrder (node->left);
if (node->right != 0)
PrintTreePreOrder (node->right);
}
int main(int argc, char **argv){
DIR *d;
tree = malloc(sizeof(Node));
tree->left = NULL;
tree->right = NULL;
tree->path = NULL;
tree->name = NULL;
duplicates = malloc(sizeof(Duplicate));
duplicates->df = NULL;
duplicates->next = NULL;
d = opendir(".");
if(d != NULL){
FindFilePath(d, ".", 0);
}
else {
perror("Kluda direktorijas atversana: ");
return -1;
}
d = NULL;
PrintTreePreOrder(tree);
FreeTree(tree);
PrintDuplicates();
tree = NULL;
return 0;
}
void PrintTreePreOrder(Node *p){
if(p == NULL) return;
printf("Atrada -> '%s/%s'\n", p->path, p->name);
PrintTreePreOrder(p->left);
PrintTreePreOrder(p->right);
}
