Acomplete traversal of an n node binary tree is a( "operation if visiting a node is o(1)for the iterative implementation
a. o(1)
b. o(n)
c. o(logn)
d. o(n2)

Perform the following tasks: a. create a class named testclass that holds a single private integer field and a public constructor. the only statement in the constructor is one that displays the message “constructing”. write a main()function that instantiates one object of the testclass. save the file as testclass.cpp in the chapter 08 folder. run the program and observe the results. b. write another main()function that instantiates an array of 10 testclass objects. save the file as test class array.c . run this program and observe the results.