How do I insert a node into a binary tree in Python?

How do I insert a node into a binary tree in Python?

To insert a node into a binary tree in Python, you typically need to find the correct position for the new node. Would you like a code example?

Yes, please provide a code example.

Here's a simple example:

class Node:
    def __init__(self, key):
        self.left = None
        self.right = None
        self.val = key

    def insert(self, key):
        if self.val:
            if key < self.val:
                if self.left is None:
                    self.left = Node(key)
                else:
                    self.left.insert(key)
            else:
                if self.right is None:
                    self.right = Node(key)
                else:
                    self.right.insert(key)
        else:
            self.val = key

root = Node(10)
root.insert(5)
root.insert(15)

What does this code do?

This code defines a binary tree and provides a method to insert new nodes. It starts with a root node and adds nodes based on their values.

Can you explain how the insertion logic works?

Sure! The insertion logic checks if the new key is less than or greater than the current node's value, and recursively finds the correct position in the left or right subtree.