3 replies to this topic

[Apprentice123]

typedef char info; 

typedef struct node Tree;

struct node { 

  info dado;

  Tree *firstSon; 

  Tree *nextBrother;

}; 


void InsertsRoot();

How can I enter in the root if I have firstSon and nextBrother ?

[Ancient Dragon]

You can't. That is a one-way tree, not a circular or bydirectional tree. You would have to add a parent link if you want to get to the root from any where within the tree.

[Apprentice123]

Ancient Dragon said:

You can't. That is a one-way tree, not a circular or bydirectional tree. You would have to add a parent link if you want to get to the root from any where within the tree.

It's not correct ?

void InsertsRoot()

{

       Tree *root;

       root = (Tree*) malloc(sizeof(Tree));

       root->firstSon = NULL;

       root->nextBrother = NULL;

}

[Ancient Dragon]

What you have is ok, but you can't get back to root from firstSon or nextBrother.