<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Database on Beyond the Bytes</title><link>https://srajesh2712.github.io/tags/database/</link><description>Recent content in Database on Beyond the Bytes</description><generator>Hugo -- 0.160.1</generator><language>en-us</language><lastBuildDate>Sun, 08 Mar 2026 05:55:00 +0000</lastBuildDate><atom:link href="https://srajesh2712.github.io/tags/database/index.xml" rel="self" type="application/rss+xml"/><item><title>From Scratch: Building and Benchmarking a Binary Search Tree in Go</title><link>https://srajesh2712.github.io/posts/2026/03/08/binary-tree/</link><pubDate>Sun, 08 Mar 2026 05:55:00 +0000</pubDate><guid>https://srajesh2712.github.io/posts/2026/03/08/binary-tree/</guid><description>A deep dive into pointers, recursion, and why tree balance is the difference between 700,000ns and 7ns.</description></item></channel></rss>