Start line:  
End line:  

Snippet Preview

Snippet HTML Code

Stack Overflow Questions
  * Copyright (C) 2011 The Guava Authors
  * Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except
  * in compliance with the License. You may obtain a copy of the License at
  * Unless required by applicable law or agreed to in writing, software distributed under the
 * License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either
 * express or implied. See the License for the specific language governing permissions and
 * limitations under the License.
An integer-valued function on binary search tree nodes that adds between nodes.

The value of individual entries must fit into an int, but the value of an entire tree can require a long.

Louis Wasserman
interface BstAggregate<N extends BstNode<?, N>> {
The total value on an entire subtree. Must be equal to the sum of the entryValue of this node and all its descendants.
  long treeValue(@Nullable N tree);

The value on a single entry, ignoring its descendants.
  int entryValue(N entry);
New to GrepCode? Check out our FAQ X