Tree



class Node:

    def __init__(self, data):

        self.left = None        self.right = None        self.data = data

    def insert(self, data):
# Compare the new value with the parent node        if self.data:
            if data < self.data:
                if self.left is None:
                    self.left = Node(data)
                else:
                    self.left.insert(data)
            elif data > self.data:
                if self.right is None:
                    self.right = Node(data)
                else:
                     self.right.insert(data)
        else:
            self.data = data

    # Print the tree    def PrintTree(self):
        if self.left:
            self.left.PrintTree()
        print(self.data),        if self.right:
            self.right.PrintTree()
class Node:

    def __init__(self, data):

        self.left = None        self.right = None        self.data = data

    def insert(self, data):
# Compare the new value with the parent node        if self.data:
            if data < self.data:
                if self.left is None:
                    self.left = Node(data)
                else:
                    self.left.insert(data)
            elif data > self.data:
                if self.right is None:
                    self.right = Node(data)
                else:
                     self.right.insert(data)
        else:
            self.data = data

    # Print the tree    def PrintTree(self):
        if self.left:
            self.left.PrintTree()
        print(self.data),        if self.right:
            self.right.PrintTree()


# Use the insert method to add nodesroot = Node(12)
root.insert(6)
root.insert(14)
root.insert(3)

root.PrintTree()
1

Komentar

Postingan populer dari blog ini

Pengalaman Kelas satu di MAN IC

Praktik Cohort Analisis menggunakan Python

Bubblesort