Recursion practice
This presentation is the property of its rightful owner.
Sponsored Links
1 / 10

Recursion practice PowerPoint PPT Presentation


  • 50 Views
  • Uploaded on
  • Presentation posted in: General

Recursion practice. Problem 0. Using recursion (and no arrays), write the code to read in a series of numbers (until EOF) and then print them backwards. Problem 1.

Download Presentation

Recursion practice

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Recursion practice

Recursion practice


Problem 0

Problem 0

  • Using recursion (and no arrays), write the code to read in a series of numbers (until EOF) and then print them backwards.


Problem 1

Problem 1

  • Write is leftist which determines if every node in a tree has a right child which is never of greater height that the left child.

a

a

a

c

b

c

b

e

d

e

d

Leftist

Leftist


Problem 2

Problem 2

  • Write the code to perform BST deletion


Problem 3

Problem 3

  • Write the code to insert a node into a binary search tree that has parent pointers.


Problem 4

Problem 4

  • Find the largest element value in a binary tree (which is not a BST)


Problem 5

Problem 5

  • Write the pseudo code to list all possible rearrangements of the letters of a provided word.

    void printAnagrams(string prefix, string word)


Reading recursion

Reading recursion

intdoit(int x) { if (x == 0) return 0; else { cout << x; return doit(x - 1); }


Recursion practice

int doit2(int x, int y)

{ if y==0 return 1;

return (x * doit2(x, y – 1));

}


Recursion practice

void doit3(tree_node *p)

{ if (p != NULL) {

doit3(p->left);

doit3(p->right);

cout << p->data << endl;

} }


  • Login