Dale - Computer Science Illuminated 328

Dale - Computer Science Illuminated 328 - grandchildren at...

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

View Full Document Right Arrow Icon
9.7 Trees 301 Figure 9.15 Stack and queue visualized as linked structures ... top ... Insertion and Deletions occur here (a) A linked stack front rear (b) A linked queue Deletions occur here Insertions occur here family relationships. If we want to model family relationships in a program, a hierarchical structure would be needed. At the top of the hier- archy would be the parents, the children would be at the next level, the
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: grandchildren at the next level, and so on. These hierarchical structures are called trees , and there is a rich mathe-matical theory relating to them. However, in computing we usually restrict our discussion to binary trees . These are trees that are restricted to each node having no more than two children....
View Full 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