What is an HTML Sitemap, and how does it work?
A separate web page called an HTML Sitemap lists hyperlinks to the site's internal pages. HTML Sitemap, like a table of contents in a physical book, allows visitors to swiftly identify and navigate to sections of interest and site web pages. HTML Sitemaps, like other web pages, are indexed by search engines.
<?xml version="1.0" encoding="UTF-8"?>
<urlset
xmlns="http://www.sitemaps.org/schemas/sitemap/0.9"
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://www.sitemaps.org/schemas/sitemap/0.9
http://www.sitemaps.org/schemas/sitemap/0.9/sitemap.xsd">
<!-- created with Free Online Sitemap Generator www.xml-sitemaps.com -->
<url>
<loc>https://dsucbasic.blogspot.com/</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>1.00</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/introduction-to-basic-data-structures.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/link-list.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2022/03/circular-linked-list.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2022/03/circular-singly-linked-list.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2022/03/circular-doubly-linked-list.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/stack.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/queue.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/arrays.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/complexity.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/tree.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/b-trees.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/binary-search-tree.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/tree-traversal.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/binary-search-tree-representation.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/avl-tree.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/heap-tree.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/sorting-in-data-structure.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/searching-algorithms-for-array_27.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/bfs-breadth-first-search.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/depth-first-search-dfs.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/graph.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/list-of-programs.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/important-points.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/selection-sorting.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/more-tutorials.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2022/02/insertion-in-singly-linked-list_27.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2022/02/insertion-in-singly-linked-list.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2022/02/doubly-linked-list.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/b-tree.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/10/c-programming-code-for-selection-sort.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/data-structure-and-algorithms.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/about-us.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/contact-us.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/privacy-policy.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/sitemap.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/p/disclaimer.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.80</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/linked-list.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/graph.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/hash-table.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/10/insertion-operation-in-max-heap.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/10/deletion-operation-in-max-heap.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/sorting-in-data-structure.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/data-definition-data-definition-defines.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/10/introduction-to-graphs.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/10/graph-representations.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/09/c-program-to-add-two-matrix.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/09/matrix-multiplication-in-c.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/09/bubble-sort-program-in-c.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/09/selection-sort-in-c.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/09/insertion-sort-in-c.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/10/merge-sorting-in-c.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/09/c-program-to-merge-two-arrays.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/09/c-program-to-reverse-array.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/10/c-program-to-implement-quick-sort.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/10/c-program-to-evaluate-postfix.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/10/c-program-to-sort-array-using-selection.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/quick-sort.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/insertion-sorting.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2022/02/singly-linked-list.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2022/02/implementation-of-tree.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.64</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/stack.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.51</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/heap.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.51</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/trees.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.51</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/basics-of-data-structure.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.51</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/dictionary.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.51</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2017/09/height-depth-and-level-of-tree.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.51</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/merge-sort.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.51</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/bubble-sorting.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.51</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/queue.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.41</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/circular-linked-list.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.41</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/heap-sort.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.41</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/time-complexity-of-algorithms.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.41</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/linear-linked-list.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.33</priority>
</url>
<url>
<loc>https://dsucbasic.blogspot.com/2016/12/queue-data-structure-using-stack.html</loc>
<lastmod>2023-01-06T15:28:16+00:00</lastmod>
<priority>0.33</priority>
</url>
</urlset>
