1 / 102

資料結構與演算法

資料結構與演算法. 課程教學投影片. 本章各段大綱 11-1 樹狀結構和特性 11-2 二元樹 11-3 二元樹的資料結構 11-4 二元樹的走訪. 11-5 二元運算樹 11-6 堆積 11-7 二元搜尋樹. 第十一章 – 樹. 11-1 樹狀結構和特性. 在樹狀結構中，一般最頂端者稱為根( Root)， 由根開始延伸出節點( node)， 所延伸出的其它節點稱為分支節點( Branch Node)， 最底端不再延伸的節點稱為終端節點( Terminal node) ， 連結二節點的線稱為節線( Edge)。. 樹狀結構的基本定義. 樹狀結構.

fiona-england
Download Presentation

資料結構與演算法

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

More Related