A tree of links obtained by repeatedly choosing a crossing, applying the skein relationship to obtain two simpler links, and repeating the process. The tree depth of a resolving tree is the number of levels of links, not including the top. The tree depth of the link is the minimal depth for any resolving tree of that link.
Resolving Tree
Explore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "Resolving Tree." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/ResolvingTree.html