Topic: Rooted Trees, Distance and Centers

The Huffman Algorithm and Its Greedy Proof

Testing Unrooted Tree Isomorphism Through Centers

Rooted Trees, Parents, and Children

Rooted and Unrooted Tree Isomorphism

Prefix Codes as Binary Trees

Preorder, Inorder, and Postorder Traversals

Ordered, Unordered, and Binary Trees

Jordan Centers of Trees

Eccentricity, Radius, and Diameter in Trees

Depth, Height, and Distance in Rooted Trees