Skip to main content

CS408: Advanced Artificial Intelligence

Page path
  • Home /
  • Courses /
  • Course Catalog /
  • Computer Science /
  • CS408: Advanced Artificial Intelligence /
  • Unit 2: Solving Problems by Searching /
  • 2.2: Tree Search Algorithms
Back to 'Unit 2: Solving Problems by Searching'
  • 2.2: Tree Search Algorithms

      • 2.2.1: Binary Search Trees

        •  Thomas Niemann's "Binary Search Tree" URL

          Read the article to learn how to build and search binary trees.

      • 2.2.2: Red-Black Trees

        •  Thomas Niemann's "Red-Black Trees" URL

          Read this article. After you read, you should know how a binary tree differs from a red-black tree and understand the basics of building and searching red-black trees.

      • 2.2.3: Skip List

        •  Thomas Niemann's "Skip List" URL

          Read this article to learn how to build and search a skip list.

    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