title: Which tree type used in java 8 HashMap bucket?
body: <p>As I know in java8 HashMap bucket implementation was changed a bit. If bucket size exceeds some value then list transforms to the "balanced tree".</p>
  
  <p>I don't understand<br>
  1. what type of balanced tree used in Oracle JDK?  (AVL? red-black? something like in databases for indexes?)<br>
  2. Is it binary tree?<br>
  3. As I understand sorting executes according hashcode. For example in my bucket I have 102 elements. 100 values with hashcode equally 12 (I understand that it worth but I just need to understand this behaviour) and 2 with hashcode 22.<br>
  How does search will be executed for value ?</p>
  
  <p><a href="https://i.stack.imgur.com/cPw4O.jpg" rel="noreferrer"><img src="https://i.stack.imgur.com/cPw4O.jpg" alt="enter image description here"></a></p>