• 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
            • Binary-tree-p
            • Bst<
            • Tree-node-with-hint
            • Bst-p
            • Tree-node
            • Tree-right
            • Tree-pre-order
            • Tree-post-order
            • Tree-in-order
            • Tree-equiv
            • Heapp
            • Tree-left
            • Tree-fix
            • Bst<-all-r
            • Bst<-all-l
            • Heap<-all-l
            • Tree-head
            • Tree-emptyp
            • Binary-tree-listp
            • Tree-induct
          • 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
      • Builtins
      • Axe
      • Solidity
      • Helpers
      • Htclient
      • Typed-lists-light
      • Arithmetic-light
    • X86isa
    • Axe
    • Execloader
  • Math
  • Testing-utilities

• Implementation

Binary-tree

Definition of a binary tree data structure.

Subtopics

Binary-tree-p

Recognizer for binary-trees.

Bst<

The total order used by bst-p.

Tree-node-with-hint

A variant of tree-node which uses cons-with-hint.

Bst-p

Check the binary search tree property.

Tree-node

Construct a nonempty binary-tree.

Tree-right

Get the right subtree of the nonempty binary-tree.

Tree-pre-order

Create a pre-order list of values from a tree.

Tree-post-order

Create a post-order list of values from a tree.

Tree-in-order

Create an in-order list of values from a tree.

Tree-equiv

Equivalence up to tree-fix.

Heapp

Check the max heap property.

Tree-left

Get the left subtree of the nonempty binary-tree.

Tree-fix

Fixer for binary-trees.

Bst<-all-r

Check that some value is bst< all members of a tree.

Bst<-all-l

Check that all members of a tree are bst< some value.

Heap<-all-l

Check that all members of a tree are heap< some value.

Tree-head

Get the root element of the nonempty binary-tree.

Tree-emptyp

Check if a binary-tree is empty.

Binary-tree-listp

Recognizer for a true list of binary trees.

Tree-induct

Induct over the structure of a binary tree.