Question
American Sharjah * 1997 CMP 340 - Design and Analysis of Algorithms Assignment #2 : Divide & Conquer Deadline : March 5th, 2024 The path length of a binary tree is defined as the sum of the lengths of all the paths that connect the root with every node in the tree. For example, the path length for the following is 14: A B F E C G H D Design a divide and conquer algorithm for finding the path length of an arbitrary binary tree. Find the complexity of the algorithm. Deliverables: submit your work by e-mail (zip and attach all relevant files) to gbarlas@aus.edu. Name your file using your ID and the number of the assignment, e.g. 3648_ass2.zip You may work individually or in teams of two. Use both IDs in naming the file in the latter case. University