ascfix 0.7.1

Automatic ASCII diagram repair tool for Markdown files
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48

# Domain: Data Structures - Binary Tree
# Tests complex tree structures common in computer science documentation

                    ┌─────────────┐
                    │     Root    │
                    │   (Value)   │
                    └─────┬───────┘
                          │
                ┌─────────┴─────────┐
                │                   │
          ┌─────▼────┐       ┌─────▼────┐
          │   Left    │       │   Right   │
          │  Child    │       │  Child    │
          └─────┬────┘       └─────┬────┘
                │                   │
          ┌─────▼────┐       ┌─────▼────┐
          │  Left     │       │  Right    │
          │  Leaf     │       │  Leaf     │
          └───────────┘       └───────────┘

# Tree traversal algorithms table
| Traversal | Order | Example | Use Case |
|-----------|-------|---------|----------|
| Inorder | Left, Root, Right | A, B, C | BST property verification |
| Preorder | Root, Left, Right | B, A, C | Copy tree structure |
| Postorder | Left, Right, Root | A, C, B | Delete tree nodes |
| Level-order | Level by level | B, A, C | Breadth-first search |

# Binary search tree properties
```
Valid BST Properties:
- Left subtree < root < right subtree
- No duplicate values allowed
- Inorder traversal gives sorted order
- Height can be O(log n) to O(n)

Operations: Insert, Delete, Search - all O(h) time
```

# Hash table collision resolution
┌─────────────────┐    ┌─────────────────┐
│   Hash Table    │    │ Collision      │
│                 │    │ Resolution     │
│ Key ──► Hash ──►│    │                 │
│ Value           │    │ Chaining       │
└─────────────────┘    │ Open           │
                       │ Addressing     │
                       └─────────────────┘