A full binary tree of height n has _________________ leaves.
a) 2 n
b) 3n
c) 2n
d) 2(n+1)
e) 3(n+1)
a) 2 n
Computer Science & Information Technology
You might also like to view...
Referential integrity must be selected to create many-to-many relationships
Indicate whether the statement is true or false
Computer Science & Information Technology
What is data-oriented programming and how does it differ from object-oriented programming?
What will be an ideal response?
Computer Science & Information Technology