MCPcopy Create free account
hub / github.com/Cee/Leetcode / Result

Class Result

865 - Smallest Subtree with all the Deepest Nodes.java:33–40  ·  view source on GitHub ↗

The result of a subtree is: Result.node: the largest depth node that is equal to or an ancestor of all the deepest nodes of this subtree. Result.dist: the number of nodes in the path from the root of this subtree, to the deepest node in this subtree.

Source from the content-addressed store, hash-verified

source not stored for this graph (policy: none)

Callers

nothing calls this directly

Calls

no outgoing calls

Tested by

no test coverage detected