Binary Trees A2 CS

When adding a new node to a tree, which is not a pointer that you need

• FreePtr

• NewNodePtr

• CurrentPtr

• PreviousPtr

• NextPtr

When initialising the tree, what should the LeftPtr field have as a value?

• The next index in the list

• NullPtr

• The RootPtr

• The size of the array

#When adding a new node to the tree:

IF TurnedLeft = TRUE

THEN

Tree [________] .Left Pointer <- NewNodePtr

• FreePtr

• CurrentPtr

• PreviousPtr

• NullPtr

• RootPtr

#When adding a new node to the tree:

Tree[_______] .Data <- Newitem

• FreePtr

• CurrentPtr

• PreviousPtr

• NewNodePtr

• RootPtr

#When adding a new node to the tree:

WHILE ThisNodePtr <> ________// while not a leaf node

• FreePtr

• CurrentPtr

• PreviousPtr

• NullPtr

• RootPtr

#When adding a new node to the tree:

IF Tree[ThisNodePtr] .Data > Newitem THEN

TurnedLeft <- TRUE

ThisNodePtr <- Tree [________].LeftPointer

• FreePtr

• ThisNodePtr

• PreviousPtr

• NullPtr

• RootPtr

#When adding a new node to the tree:

________ <- ThisNodePtr // remember this node

• FreePtr

• ThisNodePtr

• PreviousPtr

• NullPtr

• RootPtr

#When initialising the tree:

FOR Index <- 1 TO 6 // link all nodes to make free list

Tree [Index].LeftPointer <- _________

• FreePtr

• Index + 1

• Hash(Index)

• NullPtr

• 0

#When initialising the tree:

Tree [10].LeftPointer <- ________

// last node of free list

• FreePtr

• Index + 1

• Hash(Index)

• NullPtr

• 0

What is it called in programming when a function calls itself?