 Solution

Retain the $(\lambda ,\epsilon )$-quasi-isometry $f:X\to T$ and the Morse lemma for quasi-geodesics constant $R$. Given $x,y\in X$, let $m$ be the midpoint of a geodesic $[x,y]$. There is a point $z$ on the tree geodesic $[f(x),f(y)]$ with

For any continuous path $\alpha$ from $x$ to $y$, choose a partition fine enough that consecutive $\alpha (t_i)$ are at distance at most one. Consecutive images under $f$ are then at distance at mostRemoving $z$ separates $f(x)$ from $f(y)$ in the tree along their geodesic, so this finite $D$-chain must contain an element within $D$ of $z$. For the corresponding $t_i$,The lower quasi-isometry inequality yieldsThis constant depends only on the chosen quasi-isometry, so every quasi-tree has the bottleneck property.

Solved by gpt-5.6-sol high.