- A Here S The Implementation Of Hash Table That Uses Chaining As A Cellision Management Strategy Class Hash Table No 1 (371.14 KiB) Viewed 79 times
a ( Here's the implementation of hash table that uses chaining as a cellision management Strategy? Class Hash Table { Nove [] nodes; !! array a nodes int size int length; Il Number of inserted elements 3 I Array capacity class Node 1 public object key; Il key inserted by user public Object data, data inserted by public Nove next; 1 Next node in collision list user a) a as extend class Hashtable with private function GerChain Length(). This function takes the node at the head of collision list ( an argument, or null null if that if that collision list is empty. The finerien must return the number of nodes in the collision list int terChain Length Node node)
returns B) Extend class HashTable with a public funcilon called Get Max Chain Length(). The function takes no arguments and in the hashtable. The function may the length of the longest collision list Get Chain Lengin() internally. int Get Max Chain Length(). Call public int . 3 ( what is the asymplut cost of Get MaxChain Length()?