c17f99t2 - CSc 17 Test 1 Monday 22 November 1999...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
CSc 17 Test 1 Monday 22 November 1999 >>>>>>>>>>>>>>>>>>>>>SUGGESTED ANSWERS<<<<<<<<<<<<<<<<<<<<<<<<< 1. (25 pts) Write a private recursive member function for the class Tree which visits every node in a binary tree and increments the number in each node by 1. Assume the function is named INC and is called by other member functions as follows, INC(root), where the class Tree is defined as follows: class Tree{ class BinaryNode{ public: int key; BinaryNode *child[2]; }; public: //other stuff private: BinaryNode *root; //other stuff }; You need not write the prototype of INC. INC can assume that root is either NULL or the root of a properly built binary tree. void Tree::INC(BinaryNode *rt){ if(rt!=NULL){ rt->key++; INC(rt->child[0]); INC(rt->child[1]); } } 2. (15 pts) Suppose that the class Node is as defined below. Document the function PURP, below. class Node{ public: int x; Node *a[2]; }; //Return the product of all the entries in the tree whose root is r //PreConditions: r is either NULL or points to a properly constructed
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/09/2008 for the course CSE 17 taught by Professor Varies during the Spring '08 term at Lehigh University .

Page1 / 2

c17f99t2 - CSc 17 Test 1 Monday 22 November 1999...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online