Introduction to Algorithms 14: Tree data Structure--two fork tree 2016.1.14

Source: Internet
Author: User

From the beginning should be able to feel, in fact, since the ring data structure can be done, a variety of shapes of data structures can be done, as long as the design of the node's properties and the relationship between the node is OK.

The implementation of pointers will be better understood, but the programming complexity will be relatively higher, with the implementation of arrays, programming complexity is relatively low, but relatively less intuitive. So there are two ways to choose flexibly. (But many of the built-in objects in C + + can solve a lot of problems)

...... Pending update

Introduction to Algorithms 14: Tree data Structure--two fork tree 2016.1.14

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.