Question:
Prove or disprove formally:
(a) The largest even prime number is 2.
(b) The number of leaf nodes (nodes with no children) in a perfect binary tree of height h is no more than 2h.
(c) The total number of nodes in a binary tree of height h is less than 2h+1
(d) The number of 1s in the binary representation of any positive number N is less than ?log2N?.
(e) The height of any binary tree containing N nodes is less than N.
(f) The number of internal nodes in a complete binary tree of N nodes is ?N/2?.
Answer this question and show each and every step with example.