AVL (Balance Tree) C ++ code (non-recursion)

Source: Internet
Author: User

CodeMoved to the Binary Search Tree Code. The required resources are divided into 0.

Resource Description

1. There is an old AVL Tree Code in it.
2. It mainly consists of Binary Search Tree Code based on the C ++ template technology, including
AVL, BST, RBT, SBT, splay, and treap.
3. The Code is based on a bst_base to implement commonAlgorithm. The Object Features and storage structure are passed up through template parameters to implement special algorithms. In the end, different trees only need to maintain their own things. On this basis, the Code implements map, set and its corresponding structures that allow multiple identical keys. The Code contains the VC10 project, and compiled by GCC (mingw), and has the corresponding DEMO code.

Related Article

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.