Implement memtable and AVL tree for LSM-Tree based AVL

[sweep-ai[bot]]

Description

This PR implements a memtable and AVL tree for the LSM-Tree based AVL storage engine. The memtable is responsible for handling insertions, deletions, and searches of keys, while the AVL tree maintains the balance of the tree after insertions and deletions. Additionally, the memtable is flushed to disk when it reaches a certain size.

Summary of Changes

• Added memtable.go file in the root of the repository.
• Implemented a Memtable struct that contains an AVL tree and a size limit.
• Implemented methods in the Memtable struct for inserting, deleting, and searching for keys.
• Implemented a AVLTree struct that contains nodes with key, value, and child pointers.
• Implemented methods in the AVLTree struct for inserting, deleting, and searching for keys, and for balancing the tree after insertions and deletions.
• Added a method in the Memtable struct to flush its contents to disk when it reaches the size limit.

Please review and provide feedback on the changes. Thank you!

Fixes #4.

---

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

git checkout sweep/implement-memtable-avl

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.