- Sort Score
- Num 10 results
- Language All
Results 1 - 1 of 1 for rightChild (0.04 seconds)
-
android/guava/src/com/google/common/graph/Traverser.java
* * <p>This method can be used to traverse over a binary tree. Given methods {@code * leftChild(node)} and {@code rightChild(node)}, this method can be called as * * {@snippet : * Traverser.forTree(node -> ImmutableList.of(leftChild(node), rightChild(node))); * } * * @param tree {@link SuccessorsFunction} representing a directed acyclic graph that has at mostCreated: Fri Apr 03 12:43:13 GMT 2026 - Last Modified: Wed Mar 11 01:10:31 GMT 2026 - 19.3K bytes - Click Count (0)