  We prove an abstract form of the strong convergence of the Halpern-type and
Tikhonov-type proximal point algorithms in CAT(0) spaces. In addition, we
derive uniform and computable rates of metastability (in the sense of Tao) for
these iterations using proof mining techniques.
