<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom">
  <channel>
    <title>trees on Ciência Programada</title>
    <link>https://cienciaprogramada.com/tags/trees/</link>
    <description>Recent content in trees on Ciência Programada</description>
    <generator>Hugo -- gohugo.io</generator>
    <language>en</language>
    <managingEditor>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</managingEditor>
    <webMaster>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</webMaster>
    <copyright>© 2026 Francisco Bustamante</copyright>
    <lastBuildDate>Tue, 18 Aug 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://cienciaprogramada.com/tags/trees/index.xml" rel="self" type="application/rss+xml" />
    
    <item>
      <title>Trees: The Most Elegant Structure in Graphs</title>
      <link>https://cienciaprogramada.com/2026/08/trees/</link>
      <pubDate>Tue, 18 Aug 2026 00:00:00 +0000</pubDate>
      <author>contato[@]cienciaprogramada.com.br (Francisco Bustamante)</author>
      <guid>https://cienciaprogramada.com/2026/08/trees/</guid>
      <description>A file system is a tree: a connected graph with no cycles. We prove that every tree has one edge fewer than it has vertices and that its center has one or two vertices, and we look at spanning trees and rooted trees, including the difference between a balanced tree and a degenerate one.</description>
      <media:content xmlns:media="http://search.yahoo.com/mrss/" url="https://cienciaprogramada.com/2026/08/trees/featured_0096.webp" />
    </item>
    
  </channel>
</rss>
