<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"
        xmlns:xhtml="http://www.w3.org/1999/xhtml">
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/average-of-levels-in-binary-tree/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal-ii-bottomup/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-level-order-traversal/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-right-side-view/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-vertical-order-traversal/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/binary-tree-zigzag-level-order-traversal/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/count-good-nodes-in-binary-tree/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/cousins-in-binary-tree/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-bottom-left-tree-value/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/find-largest-value-in-each-tree-row/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/maximum-width-of-binary-tree/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/minimum-depth-of-binary-tree/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/nary-tree-level-order-traversal/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-ii-any-tree/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/populating-next-right-pointers-in-each-node/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/1</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/10</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/11</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/12</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/13</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/14</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/15</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/2</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/3</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/4</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/5</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/6</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/7</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/8</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
  <url>
    <loc>https://leyaa.ai/interview-preparation/learn/tree-bfs/symmetric-tree-bfs-approach/puzzle/9</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
</urlset>