<?xml version="1.0" encoding="UTF-8"?>
<urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9">
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-1-introduction-to-data-structures-and-arrays/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-10-queue-simulation-models-and-priority-queues/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-11-priority-queues-and-binary-tree-fundamentals/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-12-binary-tree-operations-and-cpp-implementation/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-13-binary-search-trees-and-tree-traversals/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-14-recursive-traversals-and-non-recursive-stack/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-15-level-order-traversal-and-node-deletion-in-bst/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-16-bst-deletion-algorithms-and-class-implementation/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-17-reference-variables-and-memory-in-cpp/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-18-reference-variables-and-const-keyword-rules/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-19-degenerate-binary-trees-and-avl-tree-concept/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-2-list-implementation-and-array-list-analysis/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-20-avl-tree-balance-condition-and-node-insertion/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-21-avl-tree-single-rotations-and-balance-cases/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-22-avl-double-rotations-and-cpp-avlinsert-method/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-23-avl-tree-deletion-and-rebalancing-cases/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-24-avl-deletion-cases-and-advanced-tree-applications/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-25-expression-trees-and-huffman-encoding/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-26-huffman-tree-construction-and-tree-properties/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-27-threaded-binary-trees-and-inorder-threads/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-28-threaded-tree-traversal-and-complete-binary-trees/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-29-complete-binary-trees-and-max-heap-operations/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-3-singly-linked-list-memory-and-cpp-operations/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-30-min-heap-insertion-deletion-and-buildheap/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-31-buildheap-algorithm-and-cpp-heap-class/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-32-percolatedown-method-and-linear-heap-build/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-33-priority-queues-heapsort-and-disjoint-sets-adt/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-34-equivalence-relations-and-disjoint-sets/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-35-dynamic-equivalence-and-parent-array-representation/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-36-smart-union-by-size-height-and-path-compression/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-37-disjoint-sets-maze-generation-and-image-segmentation/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-38-table-adt-dictionaries-and-binary-search/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-39-binary-search-algorithm-analysis-and-efficiency/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-4-doubly-linked-lists-and-josephus-problem/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-40-skip-list-structure-search-and-insertion/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-41-skip-list-performance-quad-nodes-and-hashing/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-42-hash-tables-collisions-and-linear-probing/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-43-hashing-applications-chaining-and-selection-sort/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-44-selection-sort-insertion-sort-and-bubble-sort/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-45-divide-and-conquer-mergesort-and-quicksort/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-5-abstract-data-types-and-array-stack-adt/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-6-linked-stack-and-operator-precedence/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-7-evaluating-postfix-expressions-with-stack/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-8-infix-to-postfix-conversion-and-cpp-templates/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
  <url>
    <loc>https://vusigma.com/cs301-data-structures-questions-answers-lecture-9-memory-organization-and-queue-adt-in-arrays/</loc>
    <lastmod>2026-10-22T10:23:28.041Z</lastmod>
    <changefreq>weekly</changefreq>
    <priority>0.8</priority>
  </url>
</urlset>