本文介绍了作者在高级数据结构和算法课程中使用Python实现loser树的过程。loser树是一种完全二叉树，具有n个外部节点和n-1个内部节点，其根节点存储整体胜者。与winner树不同，loser树将比赛失败者存储在节点内，使胜者能够更快地向上冒泡，从而提高效率。loser树在外部排序的运行生成、装箱问题等领域有广泛应用。
Loser tree in Python | Christan Christens
I am taking an Advanced Data Structures and Algorithms class with Dr. Sahni at UF. I used a data structure discussed in this class as an opportunity to learn Python a little better. I implemented the loser tree. The loser tree is a complete binary tree with n external nodes and n-1 internal nodes. The root of the tree has the overall winner. The loser tree is a more efficient version of a winner tree which are both types of Tournament Trees. In the winner tree the winner of each competition is inside the nodes, however it is more efficient to keep the loser of the competitions in side the nodes and bubble the winner up the tree.
The loser tree has applications in areas such as Run Generations during external sorts, Bin-Packing Problems (Truck Loading), and others.
I am not yet sure of how to transfer my c++ knowledge of pointer to Python, so I used an array representation of the binary tree to keep track of the nodes. If anybody knows how I could implement a tree with pointers, I would love to know.
In anycase, below is my code. It isnt great code, and any suggestions would be great! Thanks to Yet Another Coding Blog for the code highlighting tip.
扫一扫
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
