持久化数据结构（笔记）
持久化数据结构与不可变数据结构
单链表
持久化单链表
持久化二叉树
ys拷贝构造d->g->f，共享其余结点
持久化树堆
merge(a,b){
if key( a ) < key( b )
change right( a ) to merge(right( a ), b );
Otherwise,change left( b ) to merge(a,left( b ))
}
split(a,n)
Begin
If cnt =size(left( a )) n ,
Let fl ; r g =split(left( a ), n )
change left( a ) to r and return fl ; a g
Otherwise, Let fl ; r g =split(right( a ), n cnt 1)
change right( a ) to l and return f a ; r g
End
转载于:https://my.oschina.net/lfxu/blog/476809