Homework Clinic
Science Clinic => Computer Science => Programming and Graphic Design => Topic started by: cnetterville on May 22, 2019
-
A binary tree with a height of three has
◦ three subtrees
◦ three levels
◦ one root and three nodes with two children each
◦ six nodes
◦ None of these
-
three levels
-
Thanks
-
Welcome :)