Data structure, algorithms and applications-12th-12 fork Tree

Source: Internet
Author: User

One or two properties of a fork tree

1. Attribute 1: Each binary tree that is drawn with n elements (n>0) has a n-1 edge

2. The height of H (h>=0) of the two-fork tree in the tree at least H and more 2h-1 elements

Proof: The number of elements is at least h because of at least one element per layer. Each element has a maximum of two children, so the number of elements in layer I is at most 2i-1 (i>0). For h=0, the total number of elements is 0, which equals 20-1. For h>0, the number of elements cannot exceed


Data structure, algorithms and applications-12th-12 fork Tree

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: 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.