Nice ! crisp & simply put content. Have few queries : a) How is Parent node decided ? b) If it starts becoming unbalanced, due to too many lower/higher values, is Parent Node re-calculated ?
Perfect way to make the things clear quickly, thanks for sharing........Can you please share similar details about ConcurrentHashMap ? What is the Segment in CHM and how that locking mechanism different with it ?
Lots of improvement needed.... Content wise hats off, presentation is very clumsy Code not visible the biggest disadvantage of this video ...try zooming it And expedite part of videos wherein you are debugging mid parts
Interesting fact to know which I wasn't aware of, Thanks!
Nice
Informative 👍🏻👍🏻
Hi.
Code is not visible.. increase or zoom video..
To send the Key left or right of the tree, how keys are being compared if Comparable is not implemented in Key?
By hashcode() and if them equal by System.identityHashCode()
Nice ! crisp & simply put content.
Have few queries :
a) How is Parent node decided ?
b) If it starts becoming unbalanced, due to too many lower/higher values, is Parent Node re-calculated ?
The First element saved in each bucket becomes the parent node of the future tree.
Nice explanation.. thanks very much
Perfect way to make the things clear quickly, thanks for sharing........Can you please share similar details about ConcurrentHashMap ? What is the Segment in CHM and how that locking mechanism different with it ?
Lots of improvement needed.... Content wise hats off, presentation is very clumsy
Code not visible the biggest disadvantage of this video ...try zooming it
And expedite part of videos wherein you are debugging mid parts
use a bigger screen maybe ?
Can you share the link of the previous video
So in case of REHASHING, Does it use existing hash code or it calculate new hashcode for the every element??
Anyone comments is welcome..
calculating NEW HASH CODE is REHASHING
What is the use of Min treefiy threshold = 64?