• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
      • Apt
      • Zfc
      • Acre
      • Milawa
      • Smtlink
      • Abnf
      • Vwsim
      • Isar
      • Wp-gen
      • Dimacs-reader
      • Pfcs
      • Legacy-defrstobj
      • Proof-checker-array
      • Soft
      • C
      • 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
      • Java
      • Taspi
      • Bitcoin
      • Riscv
      • Des
      • Ethereum
      • X86isa
      • Sha-2
      • Yul
      • Zcash
      • Proof-checker-itp13
      • Regex
      • ACL2-programming-language
      • Json
      • Jfkr
      • Equational
      • Cryptography
      • Poseidon
      • Where-do-i-place-my-book
      • Axe
      • Bigmems
      • Builtins
      • Execloader
      • Aleo
      • Solidity
      • Paco
      • Concurrent-programs
      • Bls12-377-curves
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
    • Math
    • Testing-utilities
  • Leftist-tree-fns

Leftist-tree-structure

Functions relating to building and recognizing leftist trees.

Subtopics

Proper-lt
Checks that a tree is a legitimate leftist tree
Rank-lt
Rank of a leftist tree
Right-lt
Right sub-tree of a leftist tree
Is-empty-lt
Checks if a tree is empty
*empty-lt*
The default empty leftist tree
Root-lt
Root of a leftist tree
Left-lt
Left sub-tree of a leftist tree