python (65.2k questions)
javascript (44.3k questions)
reactjs (22.7k questions)
java (20.8k questions)
c# (17.4k questions)
html (16.3k questions)
r (13.7k questions)
android (13k questions)
Can a Binary Tree be recovered after performing Morris Postorder Traversal?
Morris Postorder Traversal alters the Binary Tree. Is it possible to recover the initial tree after the traversal?

IkhideIfidon
Votes: 0
Answers: 1
Post order Successor in a threaded binary tree
I have snippets of my code that should return the address of both the inorder and preorder successor of node alpha in a Double Threaded Binary Tree
I am stuck with how to make a procedure for the post...
JohnDanger
Votes: 0
Answers: 0
Postorder Traversal of Tree iterative method
I am trying to implement postorder traversal of tree using 2 stacks using iterative method. I have implementated the right algorithm. But still didn't getting output, getting error as, Segmentation fa...
Umesh Bagade
Votes: 0
Answers: 1
postordering depth-first-search (DFS) of HTML, using python, lxml, etree
This is not an DFS algorithm question, or library-suggestion question.
It is specifically about lxml.etree (v 4). I use python 3.9.
This library, lxml.etree, provides a way to iterate over the ElmentT...
Michael
Votes: 0
Answers: 1