<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://robots.hlt.inesc-id.pt/w/pt/index.php?action=history&amp;feed=atom&amp;title=Exemplos_de_Algoritmos_B%C3%A1sicos_com_%C3%81rvores</id>
	<title>Exemplos de Algoritmos Básicos com Árvores - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://robots.hlt.inesc-id.pt/w/pt/index.php?action=history&amp;feed=atom&amp;title=Exemplos_de_Algoritmos_B%C3%A1sicos_com_%C3%81rvores"/>
	<link rel="alternate" type="text/html" href="https://robots.hlt.inesc-id.pt/w/pt/index.php?title=Exemplos_de_Algoritmos_B%C3%A1sicos_com_%C3%81rvores&amp;action=history"/>
	<updated>2026-05-23T13:23:03Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.3</generator>
	<entry>
		<id>https://robots.hlt.inesc-id.pt/w/pt/index.php?title=Exemplos_de_Algoritmos_B%C3%A1sicos_com_%C3%81rvores&amp;diff=2701&amp;oldid=prev</id>
		<title>Root: Exemplos de Algoritmos Básicos com Ãrvores moved to Exemplos de Algoritmos Básicos com Árvores</title>
		<link rel="alternate" type="text/html" href="https://robots.hlt.inesc-id.pt/w/pt/index.php?title=Exemplos_de_Algoritmos_B%C3%A1sicos_com_%C3%81rvores&amp;diff=2701&amp;oldid=prev"/>
		<updated>2008-11-12T08:40:20Z</updated>

		<summary type="html">&lt;p&gt;&lt;a href=&quot;/w/pt/index.php?title=Exemplos_de_Algoritmos_B%C3%A1sicos_com_%C3%83%C2%81rvores&amp;amp;action=edit&amp;amp;redlink=1&quot; class=&quot;new&quot; title=&quot;Exemplos de Algoritmos Básicos com Ãrvores (page does not exist)&quot;&gt;Exemplos de Algoritmos Básicos com Ãrvores&lt;/a&gt; moved to &lt;a href=&quot;/w/pt/index.php/Exemplos_de_Algoritmos_B%C3%A1sicos_com_%C3%81rvores&quot; title=&quot;Exemplos de Algoritmos Básicos com Árvores&quot;&gt;Exemplos de Algoritmos Básicos com Árvores&lt;/a&gt;&lt;/p&gt;
&lt;table style=&quot;background-color: #fff; color: #202122;&quot; data-mw=&quot;interface&quot;&gt;
				&lt;tr class=&quot;diff-title&quot; lang=&quot;en&quot;&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;← Older revision&lt;/td&gt;
				&lt;td colspan=&quot;1&quot; style=&quot;background-color: #fff; color: #202122; text-align: center;&quot;&gt;Revision as of 08:40, 12 November 2008&lt;/td&gt;
				&lt;/tr&gt;&lt;tr&gt;&lt;td colspan=&quot;2&quot; class=&quot;diff-notice&quot; lang=&quot;en&quot;&gt;&lt;div class=&quot;mw-diff-empty&quot;&gt;(No difference)&lt;/div&gt;
&lt;/td&gt;&lt;/tr&gt;&lt;/table&gt;</summary>
		<author><name>Root</name></author>
	</entry>
	<entry>
		<id>https://robots.hlt.inesc-id.pt/w/pt/index.php?title=Exemplos_de_Algoritmos_B%C3%A1sicos_com_%C3%81rvores&amp;diff=1622&amp;oldid=prev</id>
		<title>Root at 08:41, 19 May 2005</title>
		<link rel="alternate" type="text/html" href="https://robots.hlt.inesc-id.pt/w/pt/index.php?title=Exemplos_de_Algoritmos_B%C3%A1sicos_com_%C3%81rvores&amp;diff=1622&amp;oldid=prev"/>
		<updated>2005-05-19T08:41:08Z</updated>

		<summary type="html">&lt;p&gt;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Contagem de elementos de uma árvore binária.&lt;br /&gt;
&lt;br /&gt;
    size_t &amp;#039;&amp;#039;&amp;#039;count&amp;#039;&amp;#039;&amp;#039;(link h) {&lt;br /&gt;
      if (!h) return 0;&lt;br /&gt;
      return 1 + &amp;#039;&amp;#039;&amp;#039;count&amp;#039;&amp;#039;&amp;#039;(h-&amp;gt;l) + &amp;#039;&amp;#039;&amp;#039;count&amp;#039;&amp;#039;&amp;#039;(h-&amp;gt;r);    &lt;br /&gt;
    }&lt;br /&gt;
&lt;br /&gt;
Cálculo da altura de uma árvore binária.&lt;br /&gt;
&lt;br /&gt;
    size_t &amp;#039;&amp;#039;&amp;#039;height&amp;#039;&amp;#039;&amp;#039;(link h) {&lt;br /&gt;
      int hl, hr;&lt;br /&gt;
      if (!h) return 0;&lt;br /&gt;
      hl = &amp;#039;&amp;#039;&amp;#039;height&amp;#039;&amp;#039;&amp;#039;(h-&amp;gt;l);&lt;br /&gt;
      hr = &amp;#039;&amp;#039;&amp;#039;height&amp;#039;&amp;#039;&amp;#039;(h-&amp;gt;r);&lt;br /&gt;
      return 1 + max(hl, hr);&lt;br /&gt;
    }&lt;/div&gt;</summary>
		<author><name>Root</name></author>
	</entry>
</feed>