A binary tree in which if all its levels except possibly the last, have the maximum number ofnodes and all the nodes at the last level appear as far left as possible, is known as

• A. AVL tree.
• B. full binary tree.
• C. complete binary tree.
• D. threaded tree.