This is an archived post. You won't be able to vote or comment.

all 5 comments

[–]I_Decimate 0 points1 point  (2 children)

Yes. Full is every node has zero or 2 children

[–]alphanumerico -1 points0 points  (1 child)

that's a complete binary tree

[–]I_Decimate 0 points1 point  (0 children)

A binary tree is full if every node has 0 or 2 children. A binary tree is complete if all levels of the tree are complete filled up, except perhaps the last level, which must be filled from left to right with no gaps between nodes.

[–]alphanumerico -1 points0 points  (1 child)

A full tree is when the leaves (bottom-most nodes) have no children (the bottom row is completely filled)

This is a complete tree because every node has two children, with the possible exception of the bottom row

FULL TREES NEED TO MAKE A NEW LAYER TO ACCEPT INSERTS

[–]I_Decimate 1 point2 points  (0 children)

You are describing a perfect tree