﻿<?phpxml version="1.0" encoding="utf-8"?>
<rss version="2.0" 
xmlns:content="http://purl.org/rss/1.0/modules/content/"
xmlns:wfw="http://wellformedweb.org/CommentAPI/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
>
<channel>
<title>Common Interview Questions - Write the method void Clean(Node root) which would clean Nodes but don’t use the recursion </title>
<link>http://commoninterview.com/Programming_Interview_Questions/write-the-method-void-cleannode-root-which-would-clean-nodes-but-don%E2%80%99t-use-the-recursion-/</link>
<description>The solution is to use an additional data structure such as Stack to maintain a list of unprocessed nodes, keep adding children to the stack, and then ...</description>
<pubDate>Thu, 03 Jun 2010 22:48:15 MDT</pubDate>
<language>en</language>
</channel>
</rss>

