Using quadratic probing for collision resolution #define ERROR_TABLE_FULL -1 #define ERROR_RECORD_NOT_FOUND -1 #define ERROR_DUPLICATE_RECORD -1   class HashTable{ public: HashTable(int table_size); int insert(const string &record); int retrieve(const string &record); private: int hash(const string &record); int hash_size; int record_count; string* table; };   /** * Constructor accepting table_size */ HashTable::HashTable(int table_size){ hash_size = table_size; table = …

HashTable implemented using quadratic probing for collision resolution Read More »

Here is implementation of level order traversal of a binary tree. Level order traversal is nothing more than traversing each level at a time 10 Lev 1 / \ 9 15 Lev 2 / / \ 7 12 17 Lev 3 Output 10 9 15 7 12 17 AVL Tree example ++++++++++++++++++++++ 69: 29 77 …

Level order traversal – Breadth-first Read More »