<?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 Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/trees/</link><description>Recent content in Trees on Rik Kisnah - Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 17 Sep 2019 09:00:00 -0700</lastBuildDate><atom:link href="https://www.rik-kisnah.ai/tags/trees/feed.xml" rel="self" type="application/rss+xml"/><item><title>Validate a Binary Search Tree</title><link>https://www.rik-kisnah.ai/teach/coding/validate-a-binary-search-tree/</link><pubDate>Tue, 17 Sep 2019 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/validate-a-binary-search-tree/</guid><description>Is every node bigger than everything on its left and smaller than everything on its right? Checking only the children is the famous wrong answer. Carry a range down the tree instead.</description></item><item><title>Invert a Binary Tree</title><link>https://www.rik-kisnah.ai/teach/coding/invert-a-binary-tree/</link><pubDate>Tue, 09 Oct 2018 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/invert-a-binary-tree/</guid><description>Swap left and right at every node. Three lines of recursion. The problem is a meme, but it is the cleanest test I know of whether you can trust a recursive call to do its job.</description></item></channel></rss>