I am encountering an up-arrow in pseudocode examples of balanced binary search trees. What is the author intending to denote by the use of such a symbol which can either follow or precede a variable?
type data = ....;
Tree = ↑node;
node = record
left, right: Tree;
level: integer;
key: data;
end;
var bottom, deleted, last: Tree;
procedure InitGlobalVariables;
begin
new (bottom);
bottom↑.level := 0;
bottom↑.left := bottom;
bottom↑.right := bottom;
deleted := bottom;
end;
This pseudocode is a reference to building Red-Black-Trees found here written by Arne Andersson.