How do I implement an N-ary tree in Python?

How do I implement an N-ary tree in Python?

To implement an N-ary tree in Python, you can create a class for the tree nodes. Each node can have a value and a list of children.

Can you show me a simple code example?

Sure! Here's a basic implementation:

class Node:
    def __init__(self, value):
        self.value = value
        self.children = []

    def add_child(self, child_node):
        self.children.append(child_node)

root = Node(1)
child1 = Node(2)
child2 = Node(3)
root.add_child(child1)
root.add_child(child2)

How can I traverse this N-ary tree?

You can use depth-first or breadth-first traversal. For depth-first, you can use recursion. Here's an example:

def depth_first_traversal(node):
    print(node.value)
    for child in node.children:
        depth_first_traversal(child)