class_docstr: Class representing Treap (Cartesian Tree) used to calculate the Incremental KS statistics.
code: def split_greatest(cls, node):
      if node is None:
          return None, None
  
      cls.unlazy(node)
  
      if node.right is not None:
          node.right, right = cls.split_greatest(node.right)
          left = node
      else:
          left = node.left
          node.left = None
          right = node
  
      cls.update(left)
      cls.update(right)
  
      return left, right
  
imports: from __future__ import annotations
  import math
  import random
  from river import base, stats
label_desc: Use image node_id 8 for calling the Treap obj's underlying member method code with example usage: obj.split_greatest(cls, node) and returns: left,  right, None,  None