docs(docs): add ProblemBadges component, layout slot, and enrich pages with topics/video frontmatter, plus guide placeholders and topic‑landing map.

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

@@ -2,13 +2,16 @@
 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: dot
+topics:
+  - { name: "Tree", slug: "tree" }
+  - { name: "Breadth-First Search", slug: "breadth-first-search" }
+  - { name: "Binary Tree", slug: "binary-tree" }
+video: "6ZnyEApgFYg"
 sidebar:
   label: 'Binary Tree Level Order Traversal'
   badge: 'Medium'
 ---
 
-<Badge variant="accent">Tree</Badge>
-
 ### Example 1:
 - Input: `root = [3,9,20,null,null,15,7]`
 - Output: `[[3],[9,20],[15,7]]`
@@ -80,7 +83,3 @@ class Solution:
 
         return res
 ```
-
-## Explanation
-
-<YouTube id="6ZnyEApgFYg" title="Binary Tree Level Order Traversal - BFS - Leetcode 102" />

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

@@ -2,13 +2,17 @@
 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: dot
+topics:
+  - { name: "Tree", slug: "tree" }
+  - { name: "Depth-First Search", slug: "depth-first-search" }
+  - { name: "Breadth-First Search", slug: "breadth-first-search" }
+  - { name: "Binary Tree", slug: "binary-tree" }
+video: "7cp5imvDzl4"
 sidebar:
   label: 'Count Good Nodes in Binary Tree'
   badge: 'Medium'
 ---
 
-<Badge variant="accent">Tree</Badge>
-
 ### Example 1:
 - Input: `root = [3,1,4,3,null,1,5]`
 - Output: `4`
@@ -67,7 +71,3 @@ class Solution:
 
         return dfs(root, root.val)
 ```
-
-## Explanation
-
-<YouTube id="7cp5imvDzl4" title="Microsoft's Most Asked Question 2021 - Count Good Nodes in a Binary Tree - Leetcode 1448 - Python" />

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

@@ -2,13 +2,17 @@
 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: dot
+topics:
+  - { name: "Tree", slug: "tree" }
+  - { name: "Depth-First Search", slug: "depth-first-search" }
+  - { name: "Breadth-First Search", slug: "breadth-first-search" }
+  - { name: "Binary Tree", slug: "binary-tree" }
+video: "d4zLyf32e3I"
 sidebar:
   label: 'Binary Tree Right Side View'
   badge: 'Medium'
 ---
 
-<Badge variant="accent">Tree</Badge>
-
 ### Example 1:
 - Input: `root = [1,2,3,null,5,null,4]`
 - Output: `[1,3,4]`
@@ -83,7 +87,3 @@ class Solution:
 
         return res
 ```
-
-## Explanation
-
-<YouTube id="d4zLyf32e3I" title="Binary Tree Right Side View - Breadth First Search - Leetcode 199" />