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

0 vote120 views1 answer
Add text to jpg python
Python
-1 vote130 views1 answer
Discord api python putting ids in a list
Python
0 vote127 views1 answer
How to clear multi dictionary in python
Python
1 vote133 views1 answer
Installing packages from requirements.txt file
Python
28 votes114 views2 answers
Get a slice of string in python
Python
38 votes120 views2 answers
Python extract thefile name from relative path
Python
3 votes115 views2 answers
Find minimum and maximum element in an array
Python
1 vote128 views1 answer
Sparse arrays hackerrank solution in python
Python
0 vote121 views2 answers
Python write column csv
Python
1 vote109 views1 answer
_set in django
Python