Given the TreeNode structure built in Part 3:
root = TreeNode("A")
b, c, d, e, f = [TreeNode(x) for x in "BCDEF"]
root.add_child(b)
root.add_child(c)
root.add_child(d)
c.add_child(e)
c.add_child(f)
What are the expected outputs of preorder(root) and postorder(root) respectively?

Question

Given the  TreeNode  structure built in Part 3: 
 root = TreeNode("A")
b, c, d, e, f = [TreeNode(x) for x in "BCDEF"]
root.add_child(b)
root.add_child(c)
root.add_child(d)
c.add_child(e)
c.add_child(f) 
 What are the expected outputs of  preorder(root)  and  postorder(root)  respectively?

Accepted Answer

Preorder:  ['A', 'B', 'C', 'E', 'F', 'D'] 
 Postorder:  ['B', 'E', 'F', 'C', 'D', 'A']

Answer

Preorder:  ['B', 'E', 'F', 'C', 'D', 'A'] 
 Postorder:  ['A', 'B', 'C', 'E', 'F', 'D']

Answer

Preorder:  ['A', 'B', 'C', 'D', 'E', 'F'] 
 Postorder:  ['E', 'F', 'C', 'B', 'D', 'A']

Crowdly

Given the TreeNode structure built in Part 3: root = TreeNode("A") b, c, d, ...

Хочете миттєвий доступ до всіх перевірених відповідей на moodle.medtech.tn?