1 Matching Annotations
  1. Oct 2019
  2. typeocaml.com typeocaml.com
    Functional Heap - Leftist Tree
    1
    1. akshayraj.kore 26 Oct 2019
      In order to maintain this property, each node has a rank, which indidates the length of the path between the node and the right most leaf. For example,

      Rank - https://en.wikipedia.org/wiki/Leftist_tree#S-value

      Rank of a node, is the distance from that node to the nearest leaf in the subtree rooted at that node.

      DataStructures Leftist Tree Heaps
    Visit annotations in context

    Tags

    Annotators

    URL

    typeocaml.com/2015/03/12/heap-leftist-tree/