In the given is the code for inserting a key for a B-TREE

My question is: What exactly is the line v=p doing?

Why are we putting the values of p into v? Please explain (Drawings would be helpful)

Insert(k)t // Inserts key k into T. // We assume, that k is new - i.e., is not already present v- the leaf of T where k must go. /1 Find v by executing Search(k). / v is the node where search terminated. insert k in the correct place among the keys of v v is not the root and has too many keys) p parent(v) Split(v) while ifc v is root and has too many keys) make a new node r, with child v and no keys I r will be the new root split v Insert(k)t // Inserts key k into T. // We assume, that k is new - i.e., is not already present v- the leaf of T where k must go. /1 Find v by executing Search(k). / v is the node where search terminated. insert k in the correct place among the keys of v v is not the root and has too many keys) p parent(v) Split(v) while ifc v is root and has too many keys) make a new node r, with child v and no keys I r will be the new root split v