tree树 树的python3实现的集合。 包括AVL树，间隔树等。 安装 pip3 install pytrees 用法 >> > from pytrees import AVLTree , IntervalTree , BinaryIndexTree , Trie >> > avl = AVLTree . buildFromList ([ - 1 , - 2 , 1 , 2 , 3 , 4 , 5 , 6 ]) >> > avl . visulize () -----------------Visualize Tree---------------------- 2 -1 5 -2 1 3 6 4 -----------------End Visualization----------------

HFT订单 如WK Selph所述，用于高频交易（HFT）的限价订单簿，已在Python3中实现（正在使用C实现） 基于WK Selph的博客文章： 在Archive.org的WayBackMachine上可用： "There are three main operations that a limit order book (LOB) has to implement: add, cancel, and execute. The goal is to implement these operations in O(1) time while making it possible for the trading model to efficiently ask questions like “what are the best bid and offer?”, “how much volume is there between prices A and B?” or “what is order X’s current position in the book?”. The v

An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules.Now given a sequence of insertions, you are supposed to tell the root of the resulting AVL tree.

（1）编写 AVL树判别程序，并判别一个二元查找树是否为 AVL树。二元查找树用其先序遍历结果表示，如：5，2，1，3，7，8。 （2）实现 AVL树的 ADT，包括其上的基本操作：结点的加入和删除；另外包括将一般二元查找树转变为 AVL树的操作。