• Top
    • Documentation
    • Books
    • Boolean-reasoning
    • Projects
    • Debugging
    • Std
    • Proof-automation
    • Macro-libraries
    • ACL2
    • Interfacing-tools
    • Hardware-verification
    • Software-verification
      • Kestrel-books
        • Crypto-hdwallet
        • Apt
        • Error-checking
        • Fty-extensions
        • Isar
        • Kestrel-utilities
        • Set
          • Implementation
            • Jenkins-hash
            • Binary-tree
            • Tree-split
            • Heap<
            • Tree-join
            • Tree-delete
            • Rotations
            • Tree-insert
            • Tree-intersect
            • Tree-join-at
            • Tree-union
            • Hash
            • Tree-in
            • Tree-diff
            • Tree-nodes-count
            • Setp
            • Right
            • Left
            • Head
            • Double-containment
            • Subset
            • Intersect
            • Insert
            • In
            • Delete
            • Union
            • Diff
            • From-list
            • To-list
            • Set-equiv
            • Sfix
            • Pick-a-point
            • Cardinality
            • Set-induct
            • Set-bi-induct
            • Emptyp
          • Soft
          • C
          • Bv
          • Imp-language
          • Event-macros
          • Java
          • Bitcoin
          • Ethereum
          • Yul
          • Zcash
          • ACL2-programming-language
          • Prime-fields
          • Json
          • Syntheto
          • File-io-light
          • Cryptography
          • Number-theory
          • Lists-light
          • Axe
          • Builtins
          • Solidity
          • Helpers
          • Htclient
          • Typed-lists-light
          • Arithmetic-light
        • X86isa
        • Axe
        • Execloader
      • Math
      • Testing-utilities
    • Implementation

    Tree-nodes-count

    The number of elements in a tree.

    Signature
    (tree-nodes-count tree) → *
    Arguments
    tree — Guard (binary-tree-p tree).

    Definitions and Theorems

    Function: tree-nodes-count

    (defun tree-nodes-count (tree)
     (declare (xargs :guard (binary-tree-p tree)))
     (declare (xargs :type-prescription (natp (tree-nodes-count tree))))
     (let ((__function__ 'tree-nodes-count))
       (declare (ignorable __function__))
       (mbe :logic
            (if (tree-emptyp tree)
                0
              (+ 1 (tree-nodes-count (tree-left tree))
                 (tree-nodes-count (tree-right tree))))
            :exec (fast-tree-nodes-count (list tree) 0))))