CIS-610 Data Structures and Algorithms

Home Work #6							Due:	11/04/1999

Note: This is due in two weeks but I'd recommend you to complete this or understand this before midterm 10/28.

1. Write a recursive and non-recursive algorithms to determine:
a. The number of nodes in a binary tree
b. The sum of the contents of all the nodes in a binary tree.

2. Write an algorithm to determine if a binary is Strictly binary.

3. Show (Draw) tree representation of the following:
a. infix expression :		A - B /  ( C * D $ E )
b. postfix expression:	A B + C * D E - - F G + $ 

Also; preorder and postoder traversal of the binary tree of a and inorder and preorder traversal of the binary tree b.

4. Two binary trees are similar if they are both empty or if they are both nonempty, their left subtrees are similar, and their right subtree are similar. Write an algorithm to determine if two binary trees are similar.

5. Write a routine that accepts a pointer to a binary tree and a pointer to a node of the tree and returns the level of the node in the tree.


6. Implement inorder traversal, maketree, setleft, and setright for right in-threaded binary trees under the sequential representation.