1 Matching Annotations
  1. Oct 2019
    1. 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.