u can do that
struct TreeNode
{
list<TreeNode*> listOfchildNodes; or vector<TreeNode*> von or ur
own list
int data;
};
Amit
On Aug 6, 5:18 pm, Aman Goyal <[email protected]> wrote:
> thanks, by no means we can add the child nodes dynamically to the father
> node....??
>
>
>
>
>
>
>
> On Sat, Aug 6, 2011 at 5:33 PM, rohit <[email protected]> wrote:
> > use a linked list to store child nodes, a tree node will hold pointer
> > to next sibling and a pointer to its first child.
> > typedef struct TreeNode{
> > struct TreeNode * nextSibling;
> > struct TreeNode * fistChild;
> > //rest things
> > }
>
> > On Aug 6, 4:10 pm, Aman Goyal <[email protected]> wrote:
> > > Can anyone suggests a good data structure for n-ary tree.. where n is the
> > > input by the user...
>
> > --
> > You received this message because you are subscribed to the Google Groups
> > "Algorithm Geeks" group.
> > To post to this group, send email to [email protected].
> > To unsubscribe from this group, send email to
> > [email protected].
> > For more options, visit this group at
> >http://groups.google.com/group/algogeeks?hl=en.
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
