Part 2: Concurrent Binary Search Tree

Content locked

The catalog is public. Reading this content requires approved access.

Overview

Learning Objectives

What You Are Given

What You Implement

int bst_insert(bst_t *tree, int key, int value)

int bst_lookup(bst_t *tree, int key, int *value)

int bst_delete(bst_t *tree, int key)

void bst_destroy(bst_t *tree)

The Key Technique: Hand-Over-Hand Locking

Why fine-grained locking?

What to think about

Deadlock

Building and Testing

Hints