class_docstr: A tree which can be used as a min/max heap or a sum tree
  Add or update item value - O(log N)
  Sampling an item - O(log N)
docstr: Return the total value of the tree according to the tree operation. For SUM for example, this will return
  the total sum of the tree. for MIN, this will return the minimal value
  :return: the total value of the tree
docstr_tok: ["Return","the","total","value","of","the","tree","according","to","the","tree","operation",".","For","SUM","for","example",",","this","will","return","the","total","sum","of","the","tree",".","for","MIN",",","this","will","return","the","minimal","value",":","return",":","the","total","value","of","the","tree"]
code: def total_value(self) -> float:
      """
      Return the total value of the tree according to the tree operation. For SUM for example, this will return
      the total sum of the tree. for MIN, this will return the minimal value
      :return: the total value of the tree
      """
      return self.tree[0]
  
imports: import operator
  import random
  from enum import Enum
  from typing import List, Tuple, Any
  import numpy
  from rl_coach.core_types import Transition
  from rl_coach.memories.memory import MemoryGranularity
  from rl_coach.memories.non_episodic.experience_replay import ExperienceReplayParameters, ExperienceReplay
  from rl_coach.schedules import Schedule, ConstantSchedule
label_desc: Use image node_id 4 for calling the SegmentTree obj's underlying member method code with example usage: obj.total_value() and returns: self