 These three sets are updated down the access path while keeping the splay operations in check.Another method, semisplaying, modifies the zig-zig case to reduce the amount of restructuring done in all operations.Below there is an implementation of splay trees in C++, which uses pointers to represent each node on the tree.