Turn the following pseudocode int an iterative one, Assuming k is in T: if k is in T, Insert should change its associated item to x.
k = node key
x = node value
T = Tree
Insert (k,x,t) {
if v = nil
return new Node(k,x,nil,nil) // last two are left and right child of node, respectively
else if k < v.key then
v.left = Insert(k,x,v.left)
return v
else
v.right = Insert(k,x,v.right)
return v
}