# Subtree Graph
```
00010010 00110101 00111000 01010001
01101000 01101100 10000111 10001011
10101010 10101011 10110111 11000010
11011110 11101000 11110110 11111011
00000110
```
```mermaid
graph LR
subgraph Level 0
direction LR
b00010010
b00110101
b00111000
b01010001
b01101000
b01101100
b10000111
b10001011
b10101010
b10101011
b10110111
b11000010
b11011110
b11101000
b11110110
b11111011
b00000110
end
b00010010 --> b00 --> b0 --> b[[b]]
b00110101 --> b0011 --> b00
b00111000 --> b0011
b01010001 --> b01 --> b0
b01101000 --> b01101 --> b01
b01101100 --> b01101
b10000111 --> b1000 --> b10 --> b1[[b1]] --> b
b10001011 --> b1000
b10101010 --> b1010101 --> b101 --> b10
b10101011 --> b1010101
b10110111 --> b101
b11000010 --> b110 --> b11[[b11]] --> b1
b11011110 --> b110
b11101000 --> b111[[b111]] --> b11
b11110110 --> b1111[[b1111]] --> b111
b11111011 --> x[[x]] --> b1111
b00000110 --> x
```
## Highlighted level 1 nodes
```mermaid
graph LR
subgraph Level 1
direction TB
b
b1
b11
b111
b1111
x
end
subgraph Level 0
direction LR
b00010010
b00110101
b00111000
b01010001
b01101000
b01101100
b10000111
b10001011
b10101010
b10101011
b10110111
b11000010
b11011110
b11101000
b11110110
b11111011
b00000110
end
b00010010 --> b00 --> b0 --> b[[b]]
b00110101 --> b0011 --> b00
b00111000 --> b0011
b01010001 --> b01 --> b0
b01101000 --> b01101 --> b01
b01101100 --> b01101
b10000111 --> b1000 --> b10 --> b1[[b1]] --> b
b10001011 --> b1000
b10101010 --> b1010101 --> b101 --> b10
b10101011 --> b1010101
b10110111 --> b101
b11000010 --> b110 --> b11[[b11]] --> b1
b11011110 --> b110
b11101000 --> b111[[b111]] --> b11
b11110110 --> b1111[[b1111]] --> b111
b11111011 --> x[[x]] --> b1111
b00000110 --> x
```