Python-algorithms-and-data-structures/Search_Tree at master · pavlicic1marko/Python-algorithms-and-data-structures · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
class Search_tree():
    def __init__(self, key=None):
        self.headnumber = key
        self.leftlink = None
        self.rightlink = None
    def append(self, number):
        if self.headnumber == None:
            self.headnumber = number

        else:
            xx = self.headnumber
            yy = self
            while xx:

                if number > xx:
                    if yy.rightlink == None:
                        yy.rightlink = Search_tree(number)
                        break
                    else:
                        xx = yy.rightlink.headnumber
                        yy = yy.rightlink

                elif number < xx:
                    if yy.leftlink == None:
                        yy.leftlink = Search_tree(number)
                        break
                    else:
                        xx = yy.leftlink.headnumber
                        yy = yy.leftlink

    def does_the_key_exist(self, key):
        level=1
        if True:
            xx = self.headnumber
            yy = self
            while xx:
                if key == xx:
                    print('ima',key,',na nivou',level)
                    break
                if key > xx:

                    if  yy.rightlink == None:
                        print("nema ",key)
                        break
                    xx = yy.rightlink.headnumber
                    yy = yy.rightlink
                    level+=1
                if key < xx:

                    if yy.leftlink == None :
                        print("nema ",key)
                        break
                    xx = yy.leftlink.headnumber
                    yy = yy.leftlink
                    level+=1


mojtree = Search_tree()
mojtree.append(100)
mojtree.append(11)
mojtree.append(111)
mojtree.append(1111)
mojtree.append(101)
mojtree.append(103)
mojtree.append(102)
mojtree.append(105)
mojtree.append(33)

mojtree.does_the_key_exist(100)

mojtree.does_the_key_exist(66)
mojtree.does_the_key_exist(1222)
mojtree.does_the_key_exist(6)
mojtree.does_the_key_exist(11)
mojtree.does_the_key_exist(101)
mojtree.does_the_key_exist(103)
mojtree.does_the_key_exist(105)
mojtree.does_the_key_exist(33)
mojtree.does_the_key_exist(333)