traverse through trees and recognize if there's same structure and val

you can solve it the same method as in leetcode 100 same tree

check if length of `substring - max_freq` does not exceed k

steroid version of 295 Median Finder with lazy removals and balance variable