The depth of a node is the number of edges from the root to the node.
The height of a node is the number of edges from the node to the DEEPEST leaf.
The height of a tree is a height of the root.
A full binary tree.is a binary tree in which each node has exactly zero or two children.
A complete binary tree is a binary tree, which is completely filled, with the possible EXCEPTION of the bottom level, which is filled from LEFT to RIGHT.