title: Pure functional tree with parent pointer
body: <p>I know that RB tree with left and right child can be implemented in pure functional way without degrading log n performance. Can tree with parent pointer be implemented in logarithm time? Seems like cyclic reference child->parent and parent->child requires all tree to be cloned, thus linear time.</p>