class_docstr: Class representing Treap (Cartesian Tree) used to calculate the Incremental KS statistics.
code: def split_smallest(cls, node):
      if node is None:
          return None, None
  
      left, right = None, None
  
      cls.unlazy(node)
  
      if node.left is not None:
          left, node.left = cls.split_smallest(node.left)
          right = node
      else:
          right = node.right
          node.right = None
          left = 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 7 for calling the Treap obj's underlying member method code with example usage: obj.split_smallest(cls, node) and returns: left,  right, None,  None