Implementing tre

I am trying to implement non blocking avl tree. where should i start.


Read about AVL tree

An implementation in Go

What could be blocking to an avl tree anyway?


I guess he want to implement an avl tree supporting concurrent insertion, deletion and queries without using a mutex to lock before and after operations.

A non-blocking avl tree would for instance allow to have an insertion in progress while another go routine may query values from it. Concurrent insertion and deletion looks more challenging.

To solve this problem I would search for a non-blocking avl tree implementation in another language (C, C++, Java) and translate it in Go. Non-blocking data structure is complex and difficult to get right.


Maybe thread safety data structures :slight_smile:

Although, not Go related

This topic was automatically closed 90 days after the last reply. New replies are no longer allowed.