Tag Archives: graph

Tree Traversal in O(1) Space

I’ve been reading some texts recently, and came across a very interesting way to traverse a graph, called pointer reversal. The idea is this — instead of maintaining an explicit stack (of the places you’ve visited), you try to store … Continue reading

Posted in Computers | Tagged , , , , , | 1 Comment