2.1 Rooted Trees (Definition)
{"Image DocumentName": "2.1 Rooted Trees (Definition)", "Image ImageDescription": "A rooted tree is a tree in which one vertex is distinguished from the others and is called the root. The level of a vertex v is the path length from the root to v. The height of the tree is the maximum level to any vertex of the tree. Level 0. root. Level 1. Level 2. Level 3. Note: Definition of \u2018Level\u2019 and \u2018Height\u2019 different from cs1102. Level 4.", "Image XResolution": "37", "Image YResolution": "37", "Image ResolutionUnit": "Pixels/Centimeter", "Image Software": "SlidePlayer", "Image YCbCrPositioning": "Centered"}