OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

update

Browse Source
This commit is contained in:
enqidu 2020-07-12 19:24:46 +04:00
parent 2fecf67a36
commit a707d710b5
1 changed files with 5 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

15
data_structures/skip_list.cpp
View File

@ -26,12 +26,9 @@ using std::endl;
* Node structure [Key][Node*, Node*...] * Node structure [Key][Node*, Node*...]
*/ */
struct Node { struct Node {
int key; int key; ///< key integer
// pointer of value void* value; ///< pointer of value
void* value; vector<Node*> forward; ///< nodes of the given one in all levels
// Forward Array points to the neighbour (right)
// nodes of the given one in all levels
vector<Node*> forward;
// Constructor of the node // Constructor of the node
Node(int key, int level, void* value); Node(int key, int level, void* value);
}; };
@ -54,10 +51,8 @@ Node::Node(int key, int level, void* value) {
* SkipList class implementation with basic methods * SkipList class implementation with basic methods
*/ */
class SkipList { class SkipList {
// Maximum level of the skiplist int level; ///< Maximum level of the skiplist
int level; Node *header; ///< Pointer to the header node
// Pointer to the header node
Node *header;
public: public:
SkipList(); SkipList();
int randomLevel(); int randomLevel();