Full binary trees, Complete binary trees and perfect binary trees

0

can some one please discuss the types of binary trees?
especially full binary trees , perfect binary trees and complete binary trees.
all these definitions looks same.
where actually these are used?

According to those definitions, I would draw the difference like this:

// Trees rotated 90 degrees counter clockwise
Perfect: Full: Complete:
g e
c c c
f d
a a a
e e
b b b
d d

The perfect tree is completely filled, the full tree is a perfect tree where the bottom level is partially filled, and the complete tree is a full tree where the bottom level has to be left oriented.

Hi!
I have two tables, I will call them first-half and second-half (of the year)

Table: first
id jan feb mar apr
-----------------------
2 80 90 70 60
3 50 40 60 30
Table: second
id jan feb mar apr
-----------------------
2 50 70 60 90
3 80 60 50 ...

from turtle import *
import random
def allTriMedian (w=300):
speed (0)
vertices = []
point = turtle.Point(x,y)
for i in range (3):
x = random.randint(0,300)
y = random.randint(0,300)
vertices.append(trutle.Point(x,y))
point = turtle.Point(x,y)
triangle = turtle.Polygon(vertices)
a = triangle.side()
b = triangle.side()
c = triangle.side()
m1 = tirangle.median
m2 = triangle.median ...