Work

Implementing Binary Search Trees in GP 2 (Extended Abstract)

Year: 2026

Type: article

Abstract: We present an approach to implement binary search trees in the rule-based graph programming language GP 2. Our implementation uses GP 2's rooted graph transformation rules to be fast and supports insertion, deletion and query operations. We argue that the worst-case runtime for each of the operations is O(n) for a tree with n nodes. In addition, we expect that, on average, the operations run in time O(log(n)). Hence the implementation would match the time complexity of binary search trees implementations in imperative languages.

Source: Electronic Proceedings in Theoretical Computer Science

DOI: 10.4204/eptcs.440.2

Authors: Ziad Ismaili Alaoui, Detlef Plump

Institutions: University of Liverpool, University of York

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W7119116337

FWCI:

Cites:

Cited by:

Related to: