Concurrent Binary Search Tree Implementation in Java

with no comment
Data Structures

Introduction

This article presents a concurrent binary search tree implementation in Java, designed to be concise and easy to understand. We will discuss the interface definition, followed by the implementation of concurrent search, insert, delete, and update operations. Finally, we will provide an example of executing these operations concurrently. Binary search trees (BSTs) are a widely used data structure due to their efficient search, insertion, and deletion capabilities. A BST is a tree-like data structure where each node has at most two children, and for all nodes, the left child node is less than the parent node, and the right child node is greater than the parent node.

The time complexity for search, insert, and delete operations is generally O(h), where h is the height of the tree. In a balanced tree, the height is O(log n), where n is the number of nodes. In concurrent programming, multiple threads execute simultaneously, and concurrent access to shared data structures, such as a binary search tree, can lead to unpredictable results if not handled correctly. A concurrent binary search tree ensures that these operations are thread-safe, allowing multiple threads to access and modify the tree without causing data corruption or race conditions.

Concurrent Binary Search Tree Implementation in Java

Concurrent Binary Search Tree Java Interface Definition

To implement a concurrent binary search tree in Java, we first define an interface ConcurrentBinarySearchTree with a generic type parameter T that extends the Comparable interface for type T. This constraint ensures that the items stored in the tree can be compared, which is a fundamental requirement for the operations of a binary search tree. The interface exposes four main methods: search, insert, delete, and update.

public interface ConcurrentBinarySearchTree<T extends Comparable<T>> {
    boolean search(T item);
    boolean insert(T item);
    boolean delete(T item);
    boolean update(T oldItem, T newItem);
}

public class ConcurrentBST<T extends Comparable<T>> implements ConcurrentBinarySearchTree<T> {
    private Node<T> root;
    private final Object lock = new Object();
    // Scroll down for methods implementation
    // ...
}
  • The search operation checks if an item exists within the tree and returns true if found, otherwise false. The time complexity of the search operation is O(h), where h is the height of the tree.
  • The insert operation adds a new item to the tree while maintaining the binary search tree property. The time complexity of the insert operation is O(h), where h is the height of the tree.
  • The delete operation removes an item from the tree and rearranges the tree to maintain its properties. The time complexity of the delete operation is O(h), where h is the height of the tree.
  • The update operation updates an existing item in the tree with a new item while maintaining the binary search tree property. The time complexity of the update operation is O(h), where h is the height of the tree.

The next sections of this article will explain the concurrent implementations of these operations, ensuring thread-safety and efficient performance while maintaining the binary search tree properties.

Concurrent Search Operation Implementation in Binary Search Tree

The concurrent search operation allows multiple threads to search for items within the binary search tree simultaneously without causing data corruption. The search operation does not modify the tree structure, so thread-safety is achieved without the need for locks or other synchronization mechanisms.

In the search operation, we traverse the tree, starting from the root node, comparing the target item with each node’s value. If the target item is less than the current node’s value, we move to the left child; otherwise, we move to the right child. Whenever we reach a null reference, the item is not in the tree, and we return false. If we find a node with the same value as the target item, we return true. The time complexity of the search operation is O(h), where h is the height of the tree. In the worst case, we need to traverse the entire height of the tree.

public boolean search(T item) {
    // Traverses the tree, comparing each node's value with the target item.
    // If found, it returns true. Otherwise, it returns false.
    Node<T> current = root;

    while (current != null) {
        int comparison = item.compareTo(current.value);

        if (comparison == 0)
            return true;
        current = comparison < 0 ? current.left : current.right;
    }

    return false;
}

Concurrent Insert Operation Implementation in Binary Search Tree

The concurrent insert operation adds a new item to the tree while maintaining the binary search tree property. To ensure thread-safety, we use a synchronized block when modifying the tree structure. This prevents multiple threads from inserting nodes simultaneously, which could lead to data corruption.

In the insert operation, we traverse the tree to find the position for the new item. We compare the new item with each node’s value during the traversal. If the new item is less than the current node’s value, we move to the left child; otherwise, we move to the right child. If we find a node with the same value as the new item, the insertion is a duplicate, and we return false. Once we reach a null reference, we have found the position for the new item. We then lock the tree to prevent other threads from modifying it while we insert the new node. The time complexity of the insert operation is O(h), where h is the height of the tree.

public boolean insert(T item) {
    // Inserts a new node by finding its position in the tree.
    // Uses a synchronized block to ensure thread-safety during the process.
    Node<T> newNode = new Node<>(item);
    Node<T> parent = null;
    Node<T> current = root;

    while (current != null) {
        parent = current;
        int comparison = item.compareTo(current.value);

        if (comparison == 0)
            return false;
        current = comparison < 0 ? current.left : current.right;
    }

    synchronized (lock) {
        if (parent == null)
            root = newNode;
        else if (item.compareTo(parent.value) < 0)
            parent.left = newNode;
        else
            parent.right = newNode;
    }

    return true;
}

Concurrent Delete Operation Implementation

The concurrent delete operation removes an item from the tree and rearranges the tree to maintain the binary search tree property. To ensure thread-safety, we use a synchronized block when modifying the tree structure. The delete operation involves three main scenarios:

  1. The node to delete has no children: In this case, we simply remove the node from the tree and update its parent’s reference.
  2. The node to delete has one child: We remove the node from the tree and update its parent’s reference to point to the node’s single child.
  3. The node to delete has two children: We find the node with the minimum value in the right subtree (the inorder successor), replace the node to delete with the inorder successor’s value, and then delete the inorder successor.

The time complexity of the delete operation is O(h), where h is the height of the tree.

private void deleteNode(Node<T> node, Node<T> parent) {
    // Deletes a node from the tree and handles three scenarios:
    // 1. The node has no children.
    // 2. The node has one child.
    // 3. The node has two children.
    if (node.left == null && node.right == null) {
        replaceNodeInParent(parent, node, null);
} else if (node.left != null && node.right != null) {
Node<T> minRight = findMinNode(node.right);
node.value = minRight.value;
deleteNode(minRight, node);
} else {
Node<T> child = node.left != null ? node.left : node.right;
replaceNodeInParent(parent, node, child);
}
}

private void replaceNodeInParent(Node<T> parent, Node<T> node, Node<T> newNode) {
if (parent == null) {
root = newNode;
} else if (parent.left == node) {
parent.left = newNode;
} else {
parent.right = newNode;
}
}

private Node<T> findMinNode(Node<T> node) {
while (node.left != null) {
node = node.left;
}

return node;
}

Concurrent Update Operation Implementation

The concurrent update operation updates an existing item in the tree with a new item while maintaining the binary search tree property. To ensure thread-safety, we use a synchronized block when modifying the tree structure. In the update operation, we first delete the old item from the tree, and then insert the new item. By using a synchronized block, we ensure that no other thread can modify the tree between the delete and insert operations. The time complexity of the update operation is O(h), where h is the height of the tree. Since the update operation involves a delete followed by an insert, the complexity remains the same as individual delete and insert operations.

public boolean update(T oldItem, T newItem) {
    // Updates a node by deleting the old item and inserting the new one.
    // Uses a synchronized block to ensure thread-safety.
    synchronized (lock) {
        if (delete(oldItem))
            return insert(newItem);
    }

    return false;
}

Testing the Concurrent Binary Search Tree

import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;

public class Main {
    public static void main(String[] args) {
        ConcurrentBinarySearchTree<Integer> tree = new ConcurrentBinarySearchTree<>();
        int elementCount = 50000;

        // Concurrent insertions
        ExecutorService executor = Executors.newFixedThreadPool(2);
        executor.submit(() -> insertElements(tree, 1, elementCount / 2));
        executor.submit(() -> insertElements(tree, elementCount / 2 + 1, elementCount));

        // Concurrent deletions
        executor.submit(() -> deleteElements(tree, 1, elementCount / 4));
        executor.submit(() -> deleteElements(tree, elementCount / 4 + 1, elementCount / 2));

        // Concurrent updates
        executor.submit(() -> updateElements(tree, 1, elementCount / 4, elementCount));
        executor.submit(() -> updateElements(tree, elementCount / 4 + 1, elementCount / 2, elementCount));

        executor.shutdown();

        System.out.println("Processing completed.");
    }

    static void insertElements(ConcurrentBinarySearchTree<Integer> tree, int start, int end) {
        for (int i = start; i <= end; i++) {
            tree.insert(i);
        }
    }

    static void deleteElements(ConcurrentBinarySearchTree<Integer> tree, int start, int end) {
        for (int i = start; i <= end; i++) {
            tree.delete(i);
        }
    }

    static void updateElements(ConcurrentBinarySearchTree<Integer> tree, int start, int end, int offset) {
        for (int i = start; i <= end; i++) {
            tree.update(i, i + offset);
        }
    }
}

Conclusion

In conclusion, this article presented a concurrent binary search tree implementation in Java, designed to be clear and easy to understand. We discussed the interface definition and provided a thread-safe implementation of concurrent search, insert, delete, and update operations while maintaining the binary search tree properties. By using a combination of synchronized blocks and careful consideration of the areas that require synchronization, we achieved an efficient and safe manipulation of the data structure in a multi-threaded environment. The concurrent binary search tree offers time complexities of O(h) for each operation, where h is the height of the tree, making it a valuable data structure for use in concurrent programming scenarios.

Correlated Articles

Tags: No tags

Comments are closed.