If a node is inserted in left subtree , then lCount of this node is increased . For simplicity , we are assuming that all keys ( tried to be inserted ) are distinct .
if ( x < root . data ) : NEW_LINE INDENT root . left = insert ( root . left , x ) NEW_LINE root . lCount += 1 NEW_LINE DEDENT elif ( x > root . data ) : NEW_LINE INDENT root . right = insert ( root . right , x ) ; NEW_LINE DEDENT return root NEW_LINE