Answer:
B.O(n).
Explanation:
Since the time complexity of visiting a node is O(1) in iterative implementation.So the time complexity of visiting every single node in binary tree is O(n).We can use level order traversal of a binary tree using a queue.Which can visit every node in O(n) time.Level order traversal do it in a single loop without doing any extra traversal.
Answer:
A, template specifics, such as horizontal or vertical menu layout
Explanation:
Answer:
Explanation:
a. In this scenario, the best solution would have an Object of Traditional Books, CD, Music, Bookstore and Customer.
b. All five objects would be able to be called by the main program loop and the Customer Object would call upon and use either the Books or CD object, While the Bookstore object would call upon all of the other objects.
c. Both the Bookstore object and Customer object will "have" other objects as the Bookstore needs to hold information on every Book or CD in the Inventory. While the Customer object would call upon the Book and CD object that they are purchasing.
d. The Music Object will extend the CD object and use information on the CD object as its parent class.
e. Since the Music Object extends the CD object it is also considered a CD since it is in CD format like the Books on CD and therefore is both objects.
send attached file with it
Answer:
The correct option for accessing the value in sarray[3] is : d) *(sptr+3)
Explanation:
a) *sptr[*3] is wrong option because its syntax is not right it will give errors.
b) *sptr+3 is also wrong option because it will add 3 to the value of sarray[0].
c) sptr+3 is wrong option because it will only access the address of sarray[3] not the value it contains.
d) *(sptr +3) is correct syntax for accessing value in sarray[3] by using pointer
