Class Treap<T>

Treap data structure combining properties of a Binary Search Tree and a Max Heap. Each node satisfies both the BST property (left < root < right) and the heap property based on priority.

Type Parameters

T
The type of values stored in the Treap.

Index

Constructors

Methods

delete inOrderTraversal insert search

Constructors

constructor

new Treap<T>(compareFn?): Treap<T>
Creates a new Treap.
Type Parameters
- T
Parameters
- OptionalcompareFn: ((a: T, b: T) => number)
  Optional comparison function for custom types.
  - - (a, b): number
    - Parameters
      a: T
      b: T
      Returns number
Returns Treap<T>
- Defined in data-structures/treaps/Treap.ts:50

Methods

delete

delete(value): boolean
Deletes a value from the Treap.
Parameters
- value: T
  The value to delete.
Returns boolean
- True if the deletion was successful, false if the value was not found.
- Defined in data-structures/treaps/Treap.ts:146

inOrderTraversal

inOrderTraversal(node?, result?): T[]
Performs an in-order traversal of the Treap for testing or debugging purposes.
Parameters
- Optionalnode: TreapNode<T> = ...
  The starting node (default is root).
- Optionalresult: T[] = []
  Accumulator for traversal result.
Returns T[]
- The in-order traversal of the Treap values.
- Defined in data-structures/treaps/Treap.ts:187

insert

insert(value, priority): boolean
Inserts a value into the Treap with a specified priority.
Parameters
- value: T
  The value to insert.
- priority: number
  The priority of the value.
Returns boolean
- Always returns true as insertion is successful.
- Defined in data-structures/treaps/Treap.ts:60

search

search(value): boolean
Searches for a value in the Treap.
Parameters
- value: T
  The value to search for.
Returns boolean
- True if the value is found, false otherwise.
- Defined in data-structures/treaps/Treap.ts:122