Data structure and algorithm the 12th chapter advanced data structure and its implementation

Source: Internet
Author: User

The data structure to be spoken in this chapter is mostly practical.

12.1 Top-down stretching tree some definitions

Expand: For the operation of the tree, the leaf node x is inserted and rotated to make the X a new root.

Amortization Time: One of the concepts in amortization analysis is the average time to find all cases of an operation. Unlike O (), the latter represents the time it takes for the program to complete in the worst case scenario.

P345, some of the content is not very clear, more than 12.1, why the rotation after the tree is disconnected. I'm not quite sure what's going on here.

Data structure and algorithm the 12th chapter advanced data structure and its implementation

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.