Which statement is false?
a) in a tightly packed binary tree, each level contains about twice as many elements as the previous level.
b) when searching a tightly packed 1,000,000-element binary search tree, a maximum of approximately 20 comparisons need to be made.
c) the level-order traversal of a binary tree visits the nodes of the tree row-by-row starting at the root node level.
d) searching a binary tree for a value that matches a key value is slow for tightly packed trees.

Grade 91.)the gravitational pull from the moon words).2.) what is the rate of gravitational 3.)if you drop a hammer, is it more likely to drop handle side down, head side down, or equal chance that it will land either way? why? 4.)a car moves 60km east and 90km west. a.) what is the distance the car traveled? b.) what is the car's displacement5.)what is the average velocity of a car that moved 60 km south in 3 hours? 6.) a car starts from rest and acceleration to 60 m/s over a time of 5 seconds. what is the acceleration of the car? 7.)what is the speed of an object at rest?