《6左偏树》-精选·课件设计.pptVIP

高级数据结构 ——左偏树 Leftist Trees Leftist Trees Linked binary tree. Can do everything a heap can do and in the same complexity. insert remove min (or max) initialize Can meld two leftist tree priority queues in O(log n) time. Extended Binary Trees Start with any binary tree and add an external node wherever there is an empty subtree. Result is an extended binary tree. A Binary Tree An Extended Binary Tree The Function s() For any node x in an extended binary tree, let s(x) be the length of a shortest path from x to an external node in the subtree rooted at x. s() Values Example s() Values Exam