Insertion dans un ABR (2)

Un arbre binaire de recherche est soit vide, représenté en Python par la valeur None, soit un nœud, contenant une étiquette et deux sous-arbres gauche et droit et représenté par une instance de la classe Noeud donnée ci-dessous.

On considère ici que les étiquettes des nœuds sont des entiers et que les arbres binaires de recherche considérés ne contiennent pas de doublons.

Exemple d'utilisation

Python Console Session

>>> arbre = Noeud(7)
>>> for cle in (3, 9, 1, 6):
        arbre.inserer(cle)
>>> arbre.gauche.etiquette
3
>>> arbre.droit.etiquette
9
>>> arbre.gauche.gauche.etiquette
1
>>> arbre.gauche.droit.etiquette
6

Exercice

Compléter le script ci-dessous :

Évaluations restantes : 5/5

.128013witkcvN8o-)yl0bqp_.!P3(Ia;g=/m4rseM97Sf,dè 612:é5nuCh050P0I0d0z0c0n0H0R0f0n0z0H0H0C010d0c0r010406050H0Z0E0E0z0G0m040M0j0n0Z0_0j0Y050D101214160~0r04051m1f1p0D1m0~0P0c0g0.0:0=0@0:0Y0B0Z0z0B0I0k0r0m0d0#1d0R0#0c0B0#0n1R0#0d0|050)0p0n0I1y0;0?011Q1S1U1S0d1!1$1Y0d0G1n1M0.190H0r0z0Y0@0U011(1A010N0+0I0Y0z0E0I1Y1}1 241*271$2a2c0|0a0R0v0G0j0r0j0H0c1c0Y0R0%1{0G0G0I0f2x1f2f0Y1n0D1M2K1@1_1^1Z0P2h1B0c0Y292u1Y1v1x0/1)2U2W0Y0j2!1Y0r2D1n2I2K2;0 1~2y2$252*0G130n1Y0z1P2D0N0@030s0s0f2+0I1U2)0j0k0T3f0|0R0T1f0z2=2^0}2@2g2`1*2|2~30320I340136383a3c2X3f0k22040R0U3l3n1 3p2I2T013u0z2 1n310#333537390%3E2*3G0w3i0w3M2H3o0~3Q3s0@3T3V053X3Z3A3#3D2V3F3g0F3i0F3.1g3:3q2_1z3t0j2}3U3w3Y3y3!3C3%403)3g0X3i0X462;3;2^3R3^4g3|3B3$3b4m3e3g0S3i0S4s483=4b3@4d3v3W3x3z4A3 3d3G0L3i0L4J3O4u3r4M3S4O4f4Q4h4S3~4l4V3g0i3i0i4!2J4$4a2%4)4e3_3{4i3}4k4C4;0k0K3i0K4_3P4v3?4~4P3`4R4j4B3(4E3f0o0|0T0o5b4{4w4*505i535k4D3G0T0T5p3k0D3m3/4#495u4 4y524T4:413f3I0T3L5G3N4`5K5e4x4,4z4/555R0T3+045+5s5Z4(5#5h4-5j4U5*435-455W5I5Y4L4}5=514.545l5B4p5-4r5~475J612{5v5N655z560T4G5-4I6c4t5:626h5$5O5(673g0T4X5-4Z6q4K5d5;6u5?5%665A6z4?5-4^6E6e6G6t5M6v6j5_4n3f585-5a6R606T6g6V6J6w6L560U5o046;5/6f4c6,645^5Q6Z0U5D6?5F5H6d2J1q2/1f2!2N0P1_2S5e4B2Z1w1n2.0I2:3o5 1n4B7m2g0c0P0@372I5B3w7t7v6/5*232l0I7B6k7D2K5H6_0@0e0|3s7o6s250b3i7R7M3S0f0|0h0j0I0Z0P7W6*1*0{040V7o0~757r2y7A017w2^3G3I5h7^6x6M3H7E2b7G7_7C6 1Y5W0R8b0R7S1*7O040%0N7*4%4}7U3J8k4|250N0E0|372V2w378p3R7-0x8z5e0p7-0H3b8j7=8e0@7-0O7o8d7X0Y0|0(0c0q0Z0(0d0I8D4(7-0l7/7=7;2?3Q7 0s7x3g5,7~7u867I6Z3+0R7F7H6Y5m8=5~7X8n8c958d8K7X0H0P0|02030w0K0A9d9f9h9e9g0J0W1M3a1{0Y0H1@0Z2F7%0G0R2t0Z9y0:2h1%7#7%0P0t7:8z8.8:0k5{8?8~6~5m438|849R5)6Z9P927+0@9a3i968b0!0G0W1%0Z2W0R0N7%0+1$2z9i9g9o8V8X1:1%0P1d0Y9.0t9{9k9ja79K984v9M7{4o7z8@80564p9V2c9X6y0k693M9*8b8L018F0|8H0n8J8,9$010j0|9Jac8l2{8T0_8W8Y8!7=8QaDaF040C8Pav8S048UaNa0abaC7sai8/af0k6n9Q8^8 3G4Gam85aj5Ra.8aatavax04azaB7n7XaTaHa(8q3t0|0B0z9v0#aP2;aRaJ1*aTaVaQav0e7Z047#2Wa%b3ada*9N6Ba/a_6Z4Xa@ao81bya|9*a~8G8I8#4}b5bMaK8h2r2waWb40|blbgbnbpbrbf48aI7@bwa,6Obz875m4?bDa:9S3Gb,5W8+bua)7B9N6#b-8_5m58b;bAc2893m95bn0|8ibP1*94cd3@0N0|2V8H2D0Gcg018Bcoa b1co8NbUaDaY0/b$3Oav8%8)6rb(0Rae1 5B6=c0a;6z5oc4b.cKc77?3R94a}cG5e9(04a7c$9l0A0y9s0Q2D0R9D0/0W2z1 0-0na7140pc-0p2V0*c-2A2D0fbe0Gd3cA5YcGcI0Y5B71cMb?6z5DcQc1dccTavc!at0R299z9-cl0g1 0d0R0H319t0G9v0d9B0Ia6c(c%9jbtcB8-b*cJ6z7}318.djdP83anb=9Y5m5UcTdoca040cb23Obhb83@7P1$cwbi0@aT020n0d0Ad;d-awbKaAcobOcY5;aL9~aOcu0|cEb%b7cHdNdb6z8=dRa*dT3f8{8}dXap5+d#do8cd%d)d|3RcsbLe3bNaGcoaYbbbdd78obV040ubX3od,3Rbo7!1deHcCe9dK76dMb}a,0T9PeibE6l9Uenc55B9!c8esbI7Xeye0eA25e2ec5!babcd6e1eCe^b9d(9s0Icme8048Cf2d.04czf80leWcUda68ahe(5*ale+cR6zarbHesd%3b8Hf8ea5Jd9ee5Ba.e%eo816mdVa^fq3fa{e/e:c9e=d d*eXaSf1e{e404eFe bmeJeMd+aXeR9Hf8fafX62d/eT7X8%8Pb`dLbveZdO3fbyfFe,6zbCfpek6Aere;aD8gfwf=aD7-fzd8ecfj6NflfG6lb:g4cN3fb^fOfu7X8gevf$aDe?fTcU5ee`b{d}aY0PbS0dewgC0|eLgK4(eQbqeSfyfh5Kgi6!gkg1gXdigp0Tb ftfPeO8EfSf004b6gE4wcbgIg.g:f`d=3Scjf5f7fbcp0|f.g;e|fdd:h0f@8*9LfC3g6;gYfLheg#df3HcLg)a}gu8T0,gcg{gegUeY869N70hfekhyhidY7|ddhme:bJayezf/e_fWh4fYgH0jbTgxg{bkgOf:gRf,h8h2eDf;ffgU0D7q777l797i1f0d7ch:2Q2L0z1#h-0D7a7;0%0)0+0H04.

Solution

Python

class Noeud:
    def __init__(self, etiquette):
        '''Méthode constructeur pour la classe Noeud.
        Crée une feuille d'étiquette donnée.'''
        self.etiquette = etiquette
        self.gauche = None
        self.droit = None

    def inserer(self, cle):
        '''Insère la clé dans l'arbre binaire de recherche
        en préservant sa structure.'''
        if cle < self.etiquette:
            if self.gauche != None:
                self.gauche.inserer(cle)
            else:
                self.gauche = Noeud(cle) 
        else:
            if self.droit != None:
                self.droit.inserer(cle)
            else:
                self.droit = Noeud(cle)