concept new point in category algorithms

appears as: new point, new points
Algorithms and Data Structures in Action

This is an excerpt from Manning's book Algorithms and Data Structures in Action.

Listing 9.3 The search method
function search(node, target)                        #1
  if node == null then                            #2
    return null
  elsif node.point == target then                        #3
    return node
  elsif compare(target, node) < 0 then                    #4
    return search(node.left    , target)
  else                                    #5
    return search(node.right, target)
Figure 10.6 Choosing the R-tree leaf’s rectangle to which a point should be added: the new point can lie within a leaf rectangle (PA), within the intersection of two or more leaves’ rectangles (PB), or outside any of the leaves (PC and PD).