Recursively retrieve the height of a tree

Source: Internet
Author: User

/// <Summary>
/// Calculate the number of layers of a node in a tree
/// </Summary>
/// <Returns> </returns>
Public int getnodelevelcount (treenode tvnode)
{
If (tvnode = NULL)
Return 0;
If (tvnode. nodes. Count <= 0)
Return 1;

Int childrenmaxcount = 0;
Foreach (treenode node in tvnode. nodes)
{
If (childrenmaxcount <= gettreelevelcount (node) // recursively obtain the highest subnode
Childrenmaxcount = gettreelevelcount (node );
}
Return childrenmaxcount + 1; // return
}
/// <Summary>
/// Calculate the height of a tree
/// </Summary>
/// <Param name = "TV"> </param>
/// <Returns> </returns>
Public int gettreelevelcount (Treeview TV)
{
If (TV = NULL)
Return 0;
If (TV. nodes. Count <= 0)
Return 0;
Int maxcount = 0;
Foreach (treenode node in TV. nodes)
{
If (maxcount <= getnodelevelcount (node ))
Maxcount = getnodelevelcount (node );
}
Return maxcount;
}

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.