- Complete:
- 1 = complete, 0 = not complete
- int complete (node) {
- if node->key == 0
- return 1
- else
- get left node height
- get right node height
- if left & right = 0
- return 1
- else if left == right
- if left tree != full
- return 0
- else
- return complete(right)
- else if left == right + 1
- if right tree != full
- return 0
- else
- return complete(left)
- else
- return 0