• Top
  • Documentation
  • Books
  • Boolean-reasoning
  • Projects
    • Apt
    • Acre
    • Milawa
    • Smtlink
    • Aleobft
    • Abnf
    • Vwsim
    • Isar
    • Wp-gen
    • Dimacs-reader
    • Pfcs
    • Legacy-defrstobj
    • Proof-checker-array
    • Soft
    • Farray
    • Rp-rewriter
    • Instant-runoff-voting
    • Imp-language
    • Sidekick
    • Leftist-trees
      • Leftist-tree-sort
      • Leftist-tree-fns
        • Leftist-tree-ops
        • Leftist-tree-structure
          • Proper-lt
          • Rank-lt
          • Right-lt
          • Is-empty-lt
          • *empty-lt*
          • Root-lt
          • Left-lt
        • Leftist-tree-misc
      • Leftist-tree-thms
      • How-many-lt
      • Ltree-sort
    • C
    • Java
    • Taspi
    • Bitcoin
    • Des
    • Ethereum
    • X86isa
    • Sha-2
    • Yul
    • Riscv
    • Zcash
    • Proof-checker-itp13
    • Regex
    • ACL2-programming-language
    • Json
    • Jfkr
    • Equational
    • Cryptography
    • Poseidon
    • Where-do-i-place-my-book
    • Bigmems
    • Builtins
    • Axe
    • Execloader
    • Solidity
    • Leo
    • Paco
    • Concurrent-programs
  • Debugging
  • Std
  • Proof-automation
  • Macro-libraries
  • ACL2
  • Interfacing-tools
  • Hardware-verification
  • Software-verification
  • Math
  • Testing-utilities

• Leftist-tree-structure

Rank-lt

Rank of a leftist tree

Returns the rank of the tree. The rank of a tree is formally defined to be the length of its right spine. Empty trees have rank 0.