how hashmap works internally in terms of retrieving data | internal working of hashmap using get()

here i have described ,

how does the haspmap works internally in terms of retrieving data?

how does it behave when there is single data at a node ?

how does it behaves when there multiple data stored at a node , when hash collision occurs and how does it retreive data in tht situation

‐---‐----‐-------------------------------------------------------------
This is the Part 2 of hashmap working

Please go through the first part of this series , which says about how does the hash map works internally in terms of adding data and what is hash collision

Part 1 of internal working of hashmap and what is hash collision

Part 3 : Internally working of hashmap with respect to new java 1.8 features enhancement.

Part 4 : What is load factor and fill ratio in hasmap

Recommended
Internal Working of Arraylist