Can't find deepest node

[Jeroen Ceuppens]

I need to put a new node at the end of the tree, that end is not te lowest
in de list but the deepest
(the one with the most + before it)

Node A
Node 1
Node 2
Node 3
Node 4: Deepest
Node B: not this one

I need to Put everytime a new child to the Deepest so:

first:
Node A

then

Node A
Node 1

then

Node A
Node 1
Node 2

and so on

I tried many things, like TreeNodeCollect ion and
treeViewSequenc e.Nodes.GetEnum erator() But i can't find a way to fix this,
it is difficult to get the child, help me....

Thx
JC

[Vijaye Raji]

As I told before, there's no pre-defined method/property for your problem.
You need to come up with an algorithm.... Do you think something like this
will solve your problem?

TreeNode deepest;
int deepestLevel = 0;
foreach (TreeNode node in treeView.Nodes)
{
// This will get all the top level nodes - and now, let's iterate
// through each one.
int level = 0;
while (node.Nodes.Cou nt > 0)
{
level++;
node = node.Nodes[0];
}

// Check if we hit the deepest
if (level >= deepestLevel)
deepestNode = node;
}

// Now, add your new node to the deepest node
deepestNode.Nod es.Add(newNode) ;

-vJ

"Jeroen Ceuppens" <je************ *@barco.com> wrote in message
news:eg******** ******@TK2MSFTN GP10.phx.gbl...

I need to put a new node at the end of the tree, that end is not te lowest
in de list but the deepest
(the one with the most + before it)

Node A
Node 1
Node 2
Node 3
Node 4: Deepest
Node B: not this one

I need to Put everytime a new child to the Deepest so:

first:
Node A

then

Node A
Node 1

then

Node A
Node 1
Node 2

and so on

I tried many things, like TreeNodeCollect ion and
treeViewSequenc e.Nodes.GetEnum erator() But i can't find a way to fix this,
it is difficult to get the child, help me....

Thx
JC

[Vijaye Raji]

Sorry - small correction... Check below

"Vijaye Raji" <no************ @hotmail.com> wrote in message
news:9a******** ************@co mcast.com...

As I told before, there's no pre-defined method/property for your problem.
You need to come up with an algorithm.... Do you think something like this will solve your problem?

TreeNode deepest;
int deepestLevel = 0;
foreach (TreeNode node in treeView.Nodes)
{
// This will get all the top level nodes - and now, let's iterate
// through each one.
int level = 0;
while (node.Nodes.Cou nt > 0)
{
level++;
node = node.Nodes[0];
}

// Check if we hit the deepest
if (level >= deepestLevel) { deepestNode = node;
// CORRECTION: This line is important.
deepestLevel = level
} }

// Now, add your new node to the deepest node
deepestNode.Nod es.Add(newNode) ;

-vJ

"Jeroen Ceuppens" <je************ *@barco.com> wrote in message
news:eg******** ******@TK2MSFTN GP10.phx.gbl...

I need to put a new node at the end of the tree, that end is not te lowest in de list but the deepest
(the one with the most + before it)

Node A
Node 1
Node 2
Node 3
Node 4: Deepest
Node B: not this one

I need to Put everytime a new child to the Deepest so:

first:
Node A

then

Node A
Node 1

then

Node A
Node 1
Node 2

and so on

I tried many things, like TreeNodeCollect ion and
treeViewSequenc e.Nodes.GetEnum erator() But i can't find a way to fix this, it is difficult to get the child, help me....

Thx
JC

[Jeroen Ceuppens]

Thx!

There is still a problem:

C:\Documents and Settings\Eindwe rk\Mijn documenten\BARC O\Eindwerk\Proj ect
Files\thuis\29n ovember\TestTre e\Form1.cs(206) : Property or indexer
'System.Windows .Forms.TreeNode .Parent' cannot be assigned to -- it is read
only

this error i get on node = node.Nodes[0];
Do you know what i can do to make it not read only?

Thx
JC
"Vijaye Raji" <no************ @hotmail.com> schreef in bericht
news:-Y************** ******@comcast. com...

Sorry - small correction... Check below

"Vijaye Raji" <no************ @hotmail.com> wrote in message
news:9a******** ************@co mcast.com...

As I told before, there's no pre-defined method/property for your problem.

You need to come up with an algorithm.... Do you think something like

this

will solve your problem?

TreeNode deepest;
int deepestLevel = 0;
foreach (TreeNode node in treeView.Nodes)
{
// This will get all the top level nodes - and now, let's iterate
// through each one.
int level = 0;
while (node.Nodes.Cou nt > 0)
{
level++;
node = node.Nodes[0];
}

// Check if we hit the deepest
if (level >= deepestLevel)

{

deepestNode = node;

// CORRECTION: This line is important.
deepestLevel = level
}

}

// Now, add your new node to the deepest node
deepestNode.Nod es.Add(newNode) ;

-vJ

"Jeroen Ceuppens" <je************ *@barco.com> wrote in message
news:eg******** ******@TK2MSFTN GP10.phx.gbl...

I need to put a new node at the end of the tree, that end is not te

lowest in de list but the deepest
(the one with the most + before it)

Node A
Node 1
Node 2
Node 3
Node 4: Deepest
Node B: not this one

I need to Put everytime a new child to the Deepest so:

first:
Node A

then

Node A
Node 1

then

Node A
Node 1
Node 2

and so on

I tried many things, like TreeNodeCollect ion and
treeViewSequenc e.Nodes.GetEnum erator() But i can't find a way to fix this, it is difficult to get the child, help me....

Thx
JC

[Vijaye Raji]

Ok.. My mistake... objects from foreach are read-only.

Here's a modified version:

TreeNode deepestNode = null;
int deepestLevel = 0;
foreach (TreeNode node in treeView1.Nodes )
{
// This will get all the top level nodes - and now, let's
iterate
// through each one.
int level = 0;
TreeNode nodeTemp = node;
while (nodeTemp.Nodes .Count > 0)
{
level++;
nodeTemp = nodeTemp.Nodes[0];
}

// Check if we hit the deepest
if (level >= deepestLevel)
{
deepestNode = nodeTemp;
deepestLevel = level;
}
}
// Now add your new node
deepestNode.Nod es.Add(newNode) ;

-vJ

"Jeroen Ceuppens" <je************ *@barco.com> wrote in message
news:%2******** ********@TK2MSF TNGP09.phx.gbl. ..

Thx!

There is still a problem:

C:\Documents and Settings\Eindwe rk\Mijn documenten\BARC O\Eindwerk\Proj ect
Files\thuis\29n ovember\TestTre e\Form1.cs(206) : Property or indexer
'System.Windows .Forms.TreeNode .Parent' cannot be assigned to -- it is read
only

this error i get on node = node.Nodes[0];
Do you know what i can do to make it not read only?

Thx
JC
"Vijaye Raji" <no************ @hotmail.com> schreef in bericht
news:-Y************** ******@comcast. com...

Sorry - small correction... Check below

"Vijaye Raji" <no************ @hotmail.com> wrote in message
news:9a******** ************@co mcast.com...

As I told before, there's no pre-defined method/property for your problem. You need to come up with an algorithm.... Do you think something like

this

will solve your problem?

TreeNode deepest;
int deepestLevel = 0;
foreach (TreeNode node in treeView.Nodes)
{
// This will get all the top level nodes - and now, let's iterate
// through each one.
int level = 0;
while (node.Nodes.Cou nt > 0)
{
level++;
node = node.Nodes[0];
}

// Check if we hit the deepest
if (level >= deepestLevel)

{

deepestNode = node;

// CORRECTION: This line is important.
deepestLevel = level
}

}

// Now, add your new node to the deepest node
deepestNode.Nod es.Add(newNode) ;

-vJ

"Jeroen Ceuppens" <je************ *@barco.com> wrote in message
news:eg******** ******@TK2MSFTN GP10.phx.gbl...
>
> I need to put a new node at the end of the tree, that end is not te

lowest

> in de list but the deepest
> (the one with the most + before it)
>
> Node A
> Node 1
> Node 2
> Node 3
> Node 4: Deepest
> Node B: not this one
>
> I need to Put everytime a new child to the Deepest so:
>
> first:
> Node A
>
> then
>
> Node A
> Node 1
>
> then
>
> Node A
> Node 1
> Node 2
>
> and so on
>
> I tried many things, like TreeNodeCollect ion and
> treeViewSequenc e.Nodes.GetEnum erator() But i can't find a way to fix

this,

> it is difficult to get the child, help me....
>
> Thx
> JC
>
>
>

[Jeroen Ceuppens]

YEAH! it works!

Thx a lot dude!

Greetz
JC
"Vijaye Raji" <no************ @hotmail.com> schreef in bericht
news:e5******** ******@TK2MSFTN GP10.phx.gbl...

Ok.. My mistake... objects from foreach are read-only.

Here's a modified version:

TreeNode deepestNode = null;
int deepestLevel = 0;
foreach (TreeNode node in treeView1.Nodes )
{
// This will get all the top level nodes - and now, let's
iterate
// through each one.
int level = 0;
TreeNode nodeTemp = node;
while (nodeTemp.Nodes .Count > 0)
{
level++;
nodeTemp = nodeTemp.Nodes[0];
}

// Check if we hit the deepest
if (level >= deepestLevel)
{
deepestNode = nodeTemp;
deepestLevel = level;
}
}
// Now add your new node
deepestNode.Nod es.Add(newNode) ;

-vJ

"Jeroen Ceuppens" <je************ *@barco.com> wrote in message
news:%2******** ********@TK2MSF TNGP09.phx.gbl. ..

Thx!

There is still a problem:

C:\Documents and Settings\Eindwe rk\Mijn documenten\BARC O\Eindwerk\Proj ect Files\thuis\29n ovember\TestTre e\Form1.cs(206) : Property or indexer
'System.Windows .Forms.TreeNode .Parent' cannot be assigned to -- it is read only

this error i get on node = node.Nodes[0];
Do you know what i can do to make it not read only?

Thx
JC
"Vijaye Raji" <no************ @hotmail.com> schreef in bericht
news:-Y************** ******@comcast. com...

Sorry - small correction... Check below

"Vijaye Raji" <no************ @hotmail.com> wrote in message
news:9a******** ************@co mcast.com...
> As I told before, there's no pre-defined method/property for your

problem.

> You need to come up with an algorithm.... Do you think something like this
> will solve your problem?
>
> TreeNode deepest;
> int deepestLevel = 0;
> foreach (TreeNode node in treeView.Nodes)
> {
> // This will get all the top level nodes - and now, let's iterate > // through each one.
> int level = 0;
> while (node.Nodes.Cou nt > 0)
> {
> level++;
> node = node.Nodes[0];
> }
>
> // Check if we hit the deepest
> if (level >= deepestLevel)
{
> deepestNode = node;

// CORRECTION: This line is important.
deepestLevel = level
}
> }
>
> // Now, add your new node to the deepest node
> deepestNode.Nod es.Add(newNode) ;
>
> -vJ
>
> "Jeroen Ceuppens" <je************ *@barco.com> wrote in message
> news:eg******** ******@TK2MSFTN GP10.phx.gbl...
> >
> > I need to put a new node at the end of the tree, that end is not te lowest
> > in de list but the deepest
> > (the one with the most + before it)
> >
> > Node A
> > Node 1
> > Node 2
> > Node 3
> > Node 4: Deepest
> > Node B: not this one
> >
> > I need to Put everytime a new child to the Deepest so:
> >
> > first:
> > Node A
> >
> > then
> >
> > Node A
> > Node 1
> >
> > then
> >
> > Node A
> > Node 1
> > Node 2
> >
> > and so on
> >
> > I tried many things, like TreeNodeCollect ion and
> > treeViewSequenc e.Nodes.GetEnum erator() But i can't find a way to fix this,
> > it is difficult to get the child, help me....
> >
> > Thx
> > JC
> >
> >
> >
>
>