Please do not bid unless you are familiar with the Subset-Cover scheme [NNL01]. Required: Subset cover scheme implemented into a BST in C++. Given set of Users and set of revoked users, find a disjoint subset which should not include revoked users.
Code for BST already developed but will need tweaking and so scheme needs implementation into BST.
14 freelanceria on tarjonnut keskimäärin 124 £ tähän työhön
I'm C++ developer and expert in Algorithms and Data Structure like AVL tree, Red black treee, BST, Graphs, Stacks, Linked list and DFS,BFS algorithims
Dear client I am highly interested to do this project. I will make you happy.I don’t need any upfront or milestone payment. Pay me when you will happy. Looking forward. Thanks