int i = a == b ? c : d;
graph TB;
subgraph 目标结构
A2["a"]
B2["b"]
C2["c"]
D2["D"]
N["Node"] -- "left" --> A2
N["Node"] -- "consequent" --> C2
N["Node"] -- "alternate" --> D2
N["Node"] -- "right" --> B2
end
subgraph 原结构
A[":"]
B["?"]
C["=="]
A1["a"]
B1["b"]
C1["c"]
D1["D"]
A --> B
A --> D1
B --> C
B --> C1
C --> A1
C --> B1
end