Skip to main content

CS201: Elementary Data Structures

Page path
  • Home /
  • Courses /
  • Course Catalog /
  • Computer Science /
  • CS201: Elementary Data Structures /
  • Unit 8: Hash Tables, Graphs, and Trees /
  • 8.3: Trees
Back to 'Unit 8: Hash Tables, Graphs, and Trees'
  • 8.3: Trees

    • Hendrix College: Carl Burch's "Data and Procedure: Trees" Page

      Trees are a special case of graph, where the graph's nodes do not have multiple references. Tree traversal is only in one direction, downward, from root (top) to leaves (bottom). Read this page for basic definitions and illustrations.

    •  Virginia Tech: Clifford Shaffer's "Data Structures and Algorithm Analysis: Binary Trees" File

      Most discussion about trees concerns binary trees, whose nodes have no more than two branches. Read this chapter, which offers background and practical applications for binary trees.

    •  Virginia Tech: Clifford Shaffer's "Data Structures and Algorithm Analysis: Non-Binary Trees" File

      Read this chapter, which extends the discussion on binary trees to those trees whose nodes have more than just two branches.

Navigation

Art History
Biology
Business Administration
Chemistry
Communication
Economics
English
History
Mathematics

Creative Commons License
© Saylor Academy 2010-2018 except as otherwise noted. Excluding course final exams, content authored by Saylor Academy is available under a Creative Commons Attribution 3.0 Unported license. Third-party materials are the copyright of their respective owners and shared under various licenses. See www.saylor.org/open/licensinginformation for detailed licensing information.

Saylor Academy and Saylor.org® are trade names of the Constitution Foundation, a 501(c)(3) organization through which our educational activities are conducted.

Terms of Use | Privacy Policy