Реализация обхода двоичного дерева с использованием рекурсии в Python ⇐ Python
-
Гость
Реализация обхода двоичного дерева с использованием рекурсии в Python
I'm currently working on implementing binary tree traversal methods in Python using recursion. I've successfully implemented the pre-order, in-order, and post-order traversals, but I'm having trouble understanding how to implement the Braunschweig method for tree traversal.
Could someone please provide a clear explanation of how to implement the Braunschweig traversal method in Python using recursion? Additionally, any code examples or pointers to resources would be greatly appreciated.
class Node: def __init__(self, value): self.value = value self.left = None self.right = None def braunschweig_traversal(node): if node is None: return print(node.value) braunschweig_traversal(node.left) braunschweig_traversal(node.right) # Example binary tree # 1 # / \ # 2 3 # / \ # 4 5 root = Node(1) root.left = Node(2) root.right = Node(3) root.left.left = Node(4) root.left.right = Node(5) print("Incorrect Braunschweig Traversal:") braunschweig_traversal(root)
Источник: https://stackoverflow.com/questions/780 ... -in-python
I'm currently working on implementing binary tree traversal methods in Python using recursion. I've successfully implemented the pre-order, in-order, and post-order traversals, but I'm having trouble understanding how to implement the Braunschweig method for tree traversal.
Could someone please provide a clear explanation of how to implement the Braunschweig traversal method in Python using recursion? Additionally, any code examples or pointers to resources would be greatly appreciated.
class Node: def __init__(self, value): self.value = value self.left = None self.right = None def braunschweig_traversal(node): if node is None: return print(node.value) braunschweig_traversal(node.left) braunschweig_traversal(node.right) # Example binary tree # 1 # / \ # 2 3 # / \ # 4 5 root = Node(1) root.left = Node(2) root.right = Node(3) root.left.left = Node(4) root.left.right = Node(5) print("Incorrect Braunschweig Traversal:") braunschweig_traversal(root)
Источник: https://stackoverflow.com/questions/780 ... -in-python
