what i have to put up with th 0800 to 0930

"it's good we got a good results."
"this topic is also available online, so i just sortcut it."
"i want to tackled first on the computation."
"your machine project will be on traveling sellperson."
"so you're going to traversed this one, then this one..."
"the simpliest way you use this algorithm."
"why not we split every full node that we encounters in the tree?"
"six divide two is three."
"therefore, i'll not going to split."
"17 will be inserted somewhere 16 and 24."
"split then you proceed go down."
"seven will join to the parent."
"if i have two values, how many links will i should have?"
"i split this one first - 20 go uf."
"if the insertions causes the tree to become overflow, split."
"after inserting 17, it's overflow."
"if you think it will not reach to the full, merge."
"does this right has more siblings than the minimum?"
"this is what i call it 'rotate'."

sige ingat.ü 
posted by stani at 5:25 PM