用平衡树实现集合运算的研究之二

Research on Set Operation Using Balance Tree(2)

定义了集合运算中公用的各种栈的数据结构,给出栈的初始化、入栈、出栈操作算法。对BT中结点进行了分类。详细论述了在BT中查找一个特定结点key值的算法,同时对三个函数(Findmax、Findmin、Leftmost)和四个过程(LMRmax Minorder Minorder1Move)的功能进行了定义,对相应的算法进行了实现,并给出时间复杂度的证明。

The paper is the later series of paper one, in this paper, the author defines the various stacks in the set computation, specifies the algorithms of initialization, pop and push operations. Classification of the nodes in BT and detailed demonstration about the algorithm for searching a given node key are given. Also definition of the 3 functions （Findmax, Findmin, Leftmost）and the 4 procedures （LMRmax Minorder Minorderl Move）are presented. And in the end, the time complexity of the algorithm is carried out.