Käynnissä

AVLTree map

Looking for a custom map container. It needs to implant an AVL self balancing binary tree rather than the Red–black tree which the std map currently uses. It should have all the same methods and functions that a normal map has.

For example:

AvlTreemap::at

AvlTreemap::begin

AvlTreemap::cbegin

AvlTreemap::cend

AvlTreemap::clear

AvlTreemap::count

AvlTreemap::crbegin

AvlTreemap::crend

AvlTreemap::emplace

AvlTreemap::emplace_hint

AvlTreemap::empty

AvlTreemap::end

AvlTreemap::equal_range

AvlTreemap::erase

AvlTreemap::find

AvlTreemap::get_allocator

AvlTreemap::insert

AvlTreemap::key_comp

AvlTreemap::lower_bound

AvlTreemap::max_size

AvlTreemap::operator=

AvlTreemap::operator[]

AvlTreemap::rbegin

AvlTreemap::rend

AvlTreemap::size

AvlTreemap::swap

AvlTreemap::upper_bound

AvlTreemap::value_comp

Taidot: C++ -ohjelmointi

Näytä lisää: tree red, tree insert, tree black, std container, self balancing tree, red black tree insert, red black tree example, red black binary tree, red binary, red black tree, map cplusplus, map begin, find binary, programming operator, cplusplus map, container programming, black red tree, black binary, binary tree balancing, binary black, balancing tree, balancing binary tree, black tree, find operator, implant

About the Employer:
( 2 reviews ) Toronto, Canada

Projektin tunnus: #4286727

Myönnetty käyttäjälle:

dobreiiita

Hi, I am C++ and data structure expert and can surely help you here, Thank You

200 $ USD 2 päivässä
(104 arvostelua)
5.8

3 freelanceria on tarjonnut keskimäärin 233 $ tähän työhön

RotorProgrammer

Hi. I can implement AVL Tree map for you in C++ with all requested operations.

250 $ USD 2 päivässä
(9 arvostelua)
4.4
fishead

Hello. I have implemented by my own and tested version of AVL trees in C++. I can implement aditional functions you need.

250 $ USD 3 päivässä
(0 arvostelua)
0.0