Dale - Computer Science Illuminated 344

# Dale - Computer Science Illuminated 344 - Thought Questions...

This preview shows page 1. Sign up to view the full content.

Thought Questions 317 35. How many more nodes could this tree have? Explain. 36. If a node with the value 9 is inserted into the tree, where does it go? 37. What is the maximum number of nodes on level 4? 38. What is the maximum number of nodes in a tree with 4 levels? 39. What are the properties of a binary tree? 40. What are the properties of a binary search tree? 41. Draw the tree that results in inserting the following strings into the tree in Figure 9.18: susy , chris , kit , jimmie , christopher , nell , al , bobby , john robert , and alex . 42. Draw a tree representing the relationships in your family. 43. Write the algorithm to determine if a list is empty. 44. Write the algorithm to determine if a list is full. Thought Questions 1. A spreadsheet is a table with rows and columns. Thank about an ADT spreadsheet. What operations would you need to construct the table? What operations would you need to manipulate the values in the table? 2.
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online