Question: 4. (15 points) Write a method that takes any two nodes u and v in a tree T, and quickly determines if the node u

4. (15 points) Write a method that takes any two nodes u and v in a tree T, and quickly determines if the node u in the tree is a descendant or ancestor of node v. You may spend O(n) time preprocessing the tree, where n is the number of nodes in the tree. Give the running time of your method and justify your running time. 4. (15 points) Write a method that takes any two nodes u and v in a tree T, and quickly determines if the node u in the tree is a descendant or ancestor of node v. You may spend O(n) time preprocessing the tree, where n is the number of nodes in the tree. Give the running time of your method and justify your running time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
