3540quiz8.s07

3540quiz8.s07 - COP 3540 Spring 2007 Quiz 8 Binary Trees...

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

COP 3540 Spring 2007 Quiz 8 – Binary Trees Name: ________________________ Directions: Put the letter of your choice over the dotted lines accompanying each question’s number. For True / False, put T or F over the dotted lines accompanying each question’s number. Fill-in: obvious. 1…. Insertion and deletion in a tree require what big O time? 2. A binary tree is a search tree if a. Every non-leaf node has children whose key values are less than (or equal to) the parent b. Every left child has a key less than the parent and every right child has a key greater than (or equal to) the parent c. In the path from the root to every leaf node, the key of each node is greater than or qual to the key of its parent d. A node can have a maximum of two children 3. In a complete binary tree with 22 nodes, and the root considered to be at level 0, how many nodes are there at level 4? 4. A Huffman tree is typically used to ________ text. 5.

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

3540quiz8.s07 - COP 3540 Spring 2007 Quiz 8 Binary Trees...

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

View Full Document
Ask a homework question - tutors are online