KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
Is it possible to do an iterative in-order-traversal on a BST whose node has a parent pointer (the parent of the root is null ) without using a visited flag or a stack ? I googled and didn't find a reply. The point is, how can I know - at a certain node - that I've just come to it vs I've finished everything underneath it?
Tags (comma-separated)
Save Edits
Cancel