When new data keeps coming, different nodes will have different state at the time of computation of this tree. This will never result in hash matching. It’s only the left nodes where we’ll have the matches. Or this process is done cleverly ?
Type your question above this line.
Course: https://www.educative.io/collection/5668639101419520/5559029852536832
Lesson: https://www.educative.io/collection/page/5668639101419520/5559029852536832/5837685720088576