Advanced BST and AVL Manipulation
Budget: $12 – $30 SGD
I am seeking a C++ enthusiast to assist me with my project that involves complex data manipulation using a Binary Search Tree (BST) and an Adelson-Velsky Landis (AVL) tree. Specifically, your task will require reading multiple CSV files that contain a sizable amount of data from text files, integrating and implementing that data using BST and AVL trees.
Key Tasks:
- Integrated implementation of BST and AVL trees. The project doesn't require separate implementations for these two data structures.
- Implementing Insertion, Search, Deletion operations on both BST and AVL trees. This involves applying these operations to handle the data from the CSV files.
- Utilization of C++ language to complete the task.
Skills and Experience:
- Proficient programming skills in C++.
- Extensive knowledge of BST and AVL Trees.
- Previous experience handling complex and large data sets.
- Excellent problem-solving skills and attention to detail.
The final product should perform all the required operations and handle the data effectively. Your code should be clean, efficient, and well commented. It's critical you have a solid understanding of data structures, particularly BST and AVL.
This is a continuation from my assignment 1 and labs after my assignment 1.
Key Tasks:
- Integrated implementation of BST and AVL trees. The project doesn't require separate implementations for these two data structures.
- Implementing Insertion, Search, Deletion operations on both BST and AVL trees. This involves applying these operations to handle the data from the CSV files.
- Utilization of C++ language to complete the task.
Skills and Experience:
- Proficient programming skills in C++.
- Extensive knowledge of BST and AVL Trees.
- Previous experience handling complex and large data sets.
- Excellent problem-solving skills and attention to detail.
The final product should perform all the required operations and handle the data effectively. Your code should be clean, efficient, and well commented. It's critical you have a solid understanding of data structures, particularly BST and AVL.
This is a continuation from my assignment 1 and labs after my assignment 1.