**Question 2
**Do a dry run on the two algorithms (ALGORITHM 1 and ALGORITHM 2) shown below.

##### Buy Custom Answer of This Assessment & Raise Your Grades

**a)** Briefly explain what the purposes of the two algorithms are and state the

asymptotic run-time complexity of each of the algorithms.

**b)** For the following Binary Search Tree (BST):

What is returned by the function call A1(root)?

**c)** For the Binary Search Tree (BST) in part (b), provide a detail analysis on

the run-time complexity of the ALGORITHM 2, as explained in the lecture.

**d)** Re-write the function A2, in pseudocode, using recursive function calls. You

may not use any form of iteration. (10.0 marks)

**e)** For a general Binary Search Tree (BST) of N elements, which of the two

algorithms A1 and A2, should you use? Give your choice and explain your

reasoning.

##### Buy Custom Answer of This Assessment & Raise Your Grades

The post CSCI203: Do a dry run on the two algorithms (ALGORITHM 1 and ALGORITHM 2) shown below: Data Structures And Algorithm Assignment, SIM appeared first on Singapore Assignment Help.