Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
This topic will cover tree traversals: A means of visiting all the objects in a tree data structure, we will look at breadth-first traversals and depth-first traversals (Pre-order and Post-order depth-first traversals), applications, general guidelines. | ATERLO ENGINEERING Tree traversals Outline This topic will cover tree traversals - A means of visiting all the objects in a tree data structure - We will look at Breadth-first traversals Depth-first traversals - Pre-order and Post-order depth-first traversals - Applications - General guidelines 7 Tree traversals 4.3 Background All the objects stored in an array or linked list can be accessed sequentially When discussing deques we introduced iterators in C - These allow the user to step through all the objects in a container Question how can we iterate through all the objects in a tree in a predictable and efficient manner - Requirements Q n run time and o n .
