BinaryTree - Insertion with Java Code

A binary tree is a tree-type non-linear data structure with a maximum of two children for each parent. Every node in a binary tree has a left and right reference along with the data element. The node at the top of the hierarchy of a tree is called the root node.

[ink]

i had been struggling for a while at understanding the role of "root.left" before making the recursive call, your explanation has cleared my doubt, thank you, very detailed explanation👍