Lecture-23

書籍內容簡介

Lecture 23: Memory representation of trees, traversal algorithms Summary of Lecture: ?? How is a tree represented in memory? ?? Types of trees ?? Tree traversal algorithms ?? Applications of trees TRAVERSING BINARY TREES There are three standard ways of traversing a binary tree T with root R. These three algorithms, called preorder, inorder and postorder, are as follows: Preorder: (1) Process the root R. (2) Traverse the left sub tree of R in preorder. (3) Traverse the right subtree of R in preo…