Alberi binari di ricerca python

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

    def insertValue(self, value):
        if not self.value:
            self.value = value
            return
        if self.value == value:
            return
        if value < self.value:
            if self.left:
                self.left.insertValue(value)
                return
            self.left = Node(value)
            return
        if self.right:
            self.right.insertValue(value)
            return
        self.right = Node(value)

    def getMin(self):
        while self.left is not None:
            self = self.left
        return self.value

    def getMax(self):
        while self.right is not None:
            self = self.right
        return self.value

def buildABR(lista):
    bst = Node()
    for x in lista:
        bst.insertValue(x)
    return bst

if __name__ == "__main__":
    lista = [99, 6, 18, -1, 21, 11, 3, 5, 4, 24, 18]
    abr = buildABR(lista)
    print(abr.getMax())
    print(abr.getMin())

Similar codes

5 votes170 views4 answers
Get user django
Python
0 vote182 views1 answer
Convert string ranges list python
Python
8 votes179 views3 answers
Python datetime to unix timestamp
Python
0 vote344 views1 answer
Python local date time
Python
14 votes191 views5 answers
Discord py get user by id
Python
1 vote183 views1 answer
Palindrome Check using for loop in python
Python
5 votes182 views3 answers
Python is not
Python
2 votes176 views3 answers
Torch.stack example
Python
1 vote189 views1 answer
Python cmath constants
Python
0 vote180 views1 answer
Pristine
Python