Question: Consider the following algorithm for doing a postorder traversal of a binary tree with root vertex root. Postorder(root) if root != null then Postorder(root.left); Postorder(root.right);
Consider the following algorithm for doing a postorder traversal of a binary tree with root vertex root.
Postorder(root)
if root != null then
Postorder(root.left);
Postorder(root.right);
visit root;
end if;
Prove that this algorithm runs in time (n) when the input is an n-vertex binary tree.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
