public void reverse( ) { Node node = root; Stack<Node> stack = new Stack<Node>( ); while( ! stack.isEmpty( ) || node != null ) { if( node != null ) { stack.push( node ); node = node.right; } else { node = stack.pop( ); System.out.print( node.data + " " ); node = node.left; } } }
Home » Graphs(We Run Facebook) » Reverse Traversal