mirror of
https://github.com/prdlk/leetcode.git
synced 2026-11-03 05:27:36 +00:00
docs(docs): add strategy, coding, and system design documentation hierarchy
This commit is contained in:
1 parent
87581c4f4b
commit
91c45ea5de
70 files changed
+1343
-31
No files matched your search
@@ -0,0 +1,10 @@
|
||||
---
|
||||
title: 'Binary Search Tree'
|
||||
description: 'A sorted array in tree form: in-order traversal is sorted order.'
|
||||
sidebar:
|
||||
order: 5
|
||||
---
|
||||
|
||||
:::warning[Under construction]
|
||||
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
|
||||
:::
|
||||
@@ -0,0 +1,20 @@
|
||||
---
|
||||
title: 'Hierarchical'
|
||||
description: 'Recursive shape: every node roots a subtree. Solutions are recurrences.'
|
||||
sidebar:
|
||||
order: 1
|
||||
label: Introduction
|
||||
---
|
||||
|
||||
:::warning[Under construction]
|
||||
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
|
||||
:::
|
||||
|
||||
## Patterns
|
||||
|
||||
- [DFS on Trees](/guides/coding/hierarchical/tree-dfs) — Post/pre/in-order recursion; the answer composes from subtree answers.
|
||||
- [BFS on Trees](/guides/coding/hierarchical/tree-bfs) — Level-order traversal via a queue.
|
||||
- [Trie](/guides/coding/hierarchical/trie) — Character-indexed tree; shared prefixes are shared paths.
|
||||
- [Binary Search Tree](/guides/coding/hierarchical/binary-search-tree) — A sorted array in tree form: in-order traversal is sorted order.
|
||||
|
||||
**Systems anchor:** Trie is a radix routing table / IPLD path resolution; the BST invariant is a B-tree index.
|
||||
@@ -0,0 +1,5 @@
|
||||
import { defineMeta } from "blume";
|
||||
|
||||
export default defineMeta({
|
||||
order: 7,
|
||||
});
|
||||
@@ -0,0 +1,10 @@
|
||||
---
|
||||
title: 'BFS on Trees'
|
||||
description: 'Level-order traversal via a queue.'
|
||||
sidebar:
|
||||
order: 3
|
||||
---
|
||||
|
||||
:::warning[Under construction]
|
||||
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
|
||||
:::
|
||||
@@ -0,0 +1,10 @@
|
||||
---
|
||||
title: 'DFS on Trees'
|
||||
description: 'Post/pre/in-order recursion; the answer composes from subtree answers.'
|
||||
sidebar:
|
||||
order: 2
|
||||
---
|
||||
|
||||
:::warning[Under construction]
|
||||
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
|
||||
:::
|
||||
@@ -0,0 +1,10 @@
|
||||
---
|
||||
title: 'Trie'
|
||||
description: 'Character-indexed tree; shared prefixes are shared paths.'
|
||||
sidebar:
|
||||
order: 4
|
||||
---
|
||||
|
||||
:::warning[Under construction]
|
||||
This page is a scaffold. Notes, canonical problems, and template code are not written yet.
|
||||
:::
|
||||
Reference in new issue
Block a user