Cartesian tree (modified)

Cartesian tree is a special kind of binary tree , Its node contains two keywords K1 and K2. First of all, Cartesian trees are about K1 Binary search tree of , That is, all of the left subtrees of the node K1 All values are higher than that of the node K1 Small value , The right subtree is bigger . Secondly, all the nodes of K2 Keywords satisfy the priority queue （ Let's set it to the minimum heap ） The sequence of requirements , That is to say, the K2 The value is higher than that of all nodes in its subtree K2 Small value .

https://blog.csdn.net/qq_48508278/article/details/119132657?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522164446015316780264041754%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=164446015316780264041754&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~top_positive~default-1-119132657.pc_search_result_control_group&utm_term=%E7%AC%9B%E5%8D%A1%E5%B0%94%E6%A0%91&spm=1018.2226.3001.4187