Blog

Given the following Binary Search Tree of integers: And the following method stub: public void postOrder(TreeNode r) {} Copy the method header above into the text box below, then write the implementation (the body) of the postOrder() method so that it performs a recursive postorder traversal  of this Binary Search Tree of integer numbers.  Assume that the reference parameter r is initially passed the reference of the root node of the tree (5 points). (Hint: This postOrder() traversal method should be very simple, consisting of a single System.out.println() statement and two if conditions which each contain a single recursive statement).

Which of the following growth-rate functions indicates a problem whose time requirement is independent of the size of the problem?

Given the following Binary Search Tree of integers: And the following method stub: public void inOrder(TreeNode r) {} Copy the method header above into the text box below, then write the implementation (the body) of the inOrder() method so that it performs a recursive inorder traversal  of this Binary Search Tree of integer numbers.  Assume that the reference parameter r is initially passed the reference of the root node of the tree (5 points). (Hint: This inOrder() traversal method should be very simple, consisting of a single System.out.println() statement and two if conditions which each contain a single recursive statement).

If a problem of size n requires time that is directly proportional to n, the problem is ________.

Using the formula for converting Strings to large numbers shown in Professor Ferguson’s video, what large number does the String “abc” convert to?

Algorithm efficiency is typically a concern for __________.

A Hash Table __________ the location of  the data to store or retrieve.

Write the code segment which is used to insert a new Node, referenced by newNode, at the end of a linear linked list.  Assume that the reference variable curr references the last node in the list. (2 points)

Write the code segment which is used to insert a new Node, referenced by the reference variable newNode, between the nodes referenced by the reference variables prev and curr in a linear linked list.  Assume that prev and curr have already been “moved into position” for the insertion operation.  (5 points)

If a stack is used by an algorithm to check for balanced braces, which of the following is true once the end of the string is reached?