Implement memtable and AVL tree in memtable.go

[sweep-ai[bot]]

Description

This PR implements the memtable and AVL tree in the newly created file, memtable.go. The memtable is implemented as a struct with methods to insert, delete, and search for keys. The AVL tree is also implemented as a struct with methods to insert, delete, and search for keys, as well as to balance the tree after insertions and deletions. Additionally, the memtable has a method to flush its contents to disk when it reaches a certain size.

Summary of Changes

• Created a new file, memtable.go, in the root of the repository
• Defined a struct for the memtable with methods to insert, delete, and search for keys
• Defined a struct for the AVL tree with methods to insert, delete, and search for keys, and to balance the tree after insertions and deletions
• Implemented a method for the memtable to flush its contents to disk when it reaches a certain size

Fixes #4.

---

To checkout this PR branch, run the following command in your terminal:

git checkout sweep/implement-memtable-avl-tree

To get Sweep to edit this pull request, leave a comment below or in the code. Leaving a comment in the code will only modify the file but commenting below can change the entire PR.

[sweep-ai[bot]]

GitHub actions yielded the following error.

##[error]Process completed with exit code 1.

The command that failed is go build -v ./....

This is likely a linting or type-checking issue with the source code. Update the code the changes and avoid modifying the existing tests.

I'm getting the same errors 3 times in a row, so I will stop working on fixing this PR.