ECE250 Lecture 10: 10 - Tree Data Structure

• School: University of Waterloo
• Department: Electrical and Computer Engineering
• Course: ECE250
• Professor: Douglas Harder

Document Summary

A rooted tree data structure stores information in nodes: similar to linked lists. Consists of nodes in which each node is a linked list of all its successors. Each linked list is also a node in which each node in it is also another linked. Terminology list of their successors: each node will have zero or more child nodes or children, for all nodes, there is one parent node. One parent node: the degree of a node is defined as the number of its children. Deg(i) = 3 (j, k, l are the children of i: nodes with a degree of zero are known as leaf nodes. The following two trees are considered to be equal if the order does not matter (since the order of the child nodes exist, otherwise they are not equal: there exists a path between two trees.