<?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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</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/solution</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/trace</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/try</loc>
    <lastmod>2026-04-17</lastmod>
    <changefreq>monthly</changefreq>
    <priority>0.6</priority>
  </url>
</urlset>