Generating Schroeder Trees.
主 题: Generating Schroeder Trees.
报告人: Prof.Seymour Lipschutz ((Temple University,USA))
时 间: 0000-00-00
地 点: 理科一号楼1114
Abstract:This talk discusses, and illustrates, two types of algorithms which occur in the generation of all objects of a combinatorial family:
(1) Gray codes, and (2) Loopless algorithms. This talk also discusses the relationship between binary trees and Schroeder trees, and gives the first loopless algorithm that generates all Schroeder trees.
