docs: replace legacy line‑dot‑left‑horizontal icons with unified dot icon across docs

apps/docs/content/(03-hierarchical)/binary-search-tree/230-kth-smallest-element-in-a-bst.mdx

@@ -1,7 +1,7 @@
 ---
 title: '230. Kth Smallest Element in a BST'
 description: Given the root of a binary search tree, and an integer k, return the k^th smallest value (1-indexed) of all the values of the nodes in the tree
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Kth Smallest Element in a BST'
   badge: 'Medium'

apps/docs/content/(03-hierarchical)/binary-search-tree/235-lowest-common-ancestor-of-a-binary-search-tree.mdx

@@ -1,7 +1,7 @@
 ---
 title: '235. Lowest Common Ancestor of a Binary Search Tree'
 description: Given a binary search tree (BST), find the lowest common ancestor (LCA) node of two given nodes in the BST
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Lowest Common Ancestor of a Binary Search Tree'
   badge: 'Medium'

apps/docs/content/(03-hierarchical)/binary-search-tree/98-validate-binary-search-tree.mdx

@@ -1,7 +1,7 @@
 ---
 title: '98. Validate Binary Search Tree'
 description: Given the root of a binary tree, determine if it is a valid binary search tree (BST)
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Validate Binary Search Tree'
   badge: 'Medium'

apps/docs/content/(03-hierarchical)/heap-priority-queue/215-kth-largest-element-in-an-array.mdx

@@ -1,7 +1,7 @@
 ---
 title: '215. Kth Largest Element in an Array'
 description: Given an integer array nums and an integer k, return the k^th largest element in the array
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Kth Largest Element in an Array'
   badge: 'Medium'

apps/docs/content/(03-hierarchical)/heap-priority-queue/23-merge-k-sorted-lists.mdx

@@ -1,7 +1,7 @@
 ---
 title: '23. Merge k Sorted Lists'
 description: You are given an array of k linked-lists lists, each linked-list is sorted in ascending order
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Merge k Sorted Lists'
   badge: 'Hard'

apps/docs/content/(03-hierarchical)/heap-priority-queue/973-k-closest-points-to-origin.mdx

@@ -1,7 +1,7 @@
 ---
 title: '973. K Closest Points to Origin'
 description: Given an array of points where points[i] = [xi, yi] represents a point on the X-Y plane and an integer k, return the k closest points to the origin (0, 0)
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'K Closest Points to Origin'
   badge: 'Medium'

apps/docs/content/(03-hierarchical)/tree-bfs/102-binary-tree-level-order-traversal.mdx

@@ -1,7 +1,7 @@
 ---
 title: '102. Binary Tree Level Order Traversal'
 description: Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level by level)
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Binary Tree Level Order Traversal'
   badge: 'Medium'

apps/docs/content/(03-hierarchical)/tree-bfs/1448-count-good-nodes-in-binary-tree.mdx

@@ -1,7 +1,7 @@
 ---
 title: '1448. Count Good Nodes in Binary Tree'
 description: Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Count Good Nodes in Binary Tree'
   badge: 'Medium'

apps/docs/content/(03-hierarchical)/tree-bfs/199-binary-tree-right-side-view.mdx

@@ -1,7 +1,7 @@
 ---
 title: '199. Binary Tree Right Side View'
 description: Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Binary Tree Right Side View'
   badge: 'Medium'

apps/docs/content/(03-hierarchical)/tree-dfs/104-maximum-depth-of-binary-tree.mdx

@@ -1,7 +1,7 @@
 ---
 title: '104. Maximum Depth of Binary Tree'
 description: Given the root of a binary tree, return its maximum depth
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Maximum Depth of Binary Tree'
   badge: 'Easy'

apps/docs/content/(03-hierarchical)/tree-dfs/226-invert-binary-tree.mdx

@@ -1,7 +1,7 @@
 ---
 title: '226. Invert Binary Tree'
 description: Given the root of a binary tree, invert the tree, and return its root
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Invert Binary Tree'
   badge: 'Easy'

apps/docs/content/(03-hierarchical)/tree-dfs/236-lowest-common-ancestor-of-a-binary-tree.mdx

@@ -1,7 +1,7 @@
 ---
 title: '236. Lowest Common Ancestor of a Binary Tree'
 description: Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Lowest Common Ancestor of a Binary Tree'
   badge: 'Medium'

apps/docs/content/(03-hierarchical)/trie/208-implement-trie-prefix-tree.mdx

@@ -1,7 +1,7 @@
 ---
 title: '208. Implement Trie (Prefix Tree)'
 description: A trie (pronounced as "try") or prefix tree is a tree data structure used to efficiently store and retrieve keys in a dataset of strings. There are various applications of this data structure, such as autocomplete and spellchecker
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Implement Trie (Prefix Tree)'
   badge: 'Medium'

apps/docs/content/(03-hierarchical)/trie/211-design-add-and-search-words-data-structure.mdx

@@ -1,7 +1,7 @@
 ---
 title: '211. Design Add and Search Words Data Structure'
 description: Design a data structure that supports adding new words and finding if a string matches any previously added string
-icon: line-dot-left-horizontal
+icon: dot
 sidebar:
   label: 'Design Add and Search Words Data Structure'
   badge: 'Medium'