Question: (30 points, 15 points each) Q2.2. Please write pseudo codes for two following separate operations respectively in O(N) time. The input is only a pointer

 (30 points, 15 points each) Q2.2. Please write pseudo codes for

(30 points, 15 points each) Q2.2. Please write pseudo codes for two following separate operations respectively in O(N) time. The input is only a pointer to the root of a binary tree T, a. Compute the number of nodes in T b. Compute the number of leaves in T Please also briefly explain why your pseudo codes run in O(N) time. (hint: You can use recursive function.)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!