1 / 5

MAA

Epic programming. MAA. Marshall Capps, Alvin Cheung, Anh Ho. Mission. It already has your programming assignment in it. Implemented – Tree (recursive data structure) in H--. Built in functions. Infix – returns infix order of nodes in tree Prefix – returns prefix order of nodes in tree

ellis
Download Presentation

MAA

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Epic programming MAA Marshall Capps, Alvin Cheung, Anh Ho

  2. Mission • It already has your programming assignment in it. • Implemented – Tree (recursive data structure) in H--

  3. Built in functions • Infix – returns infix order of nodes in tree • Prefix – returns prefix order of nodes in tree • Size – returns the total number of nodes • Height – returns the height of the tree • Add – adds a new node to the tree, returns true if it added successfully • Remove – removes node from the tree, returns true if it removed it successfully • Contains – returns true if a node exists in the tree • Root – returns the root of the tree • Lchild – returns the left child of the current node • Rchild – returns the right child of the current node • Max – returns the max value in the tree • Min – returns the min value in the tree

  4. Forests are good for: • Faster searching • Faster indexing • Faster storing • Big O(log(n))

  5. Demonstration

More Related