AVL 树的一些探究

```mermaid graph TD; A(危机) --> D --> new --> B(h-1); D --> E(h-1); A --> C(h-1); ```

```mermaid graph TD; D --> new --> DLL(h-1); A --> DR(h-1); D --> A(危机) --> h-1; ```

LR 情况

```mermaid graph TD; A(危机) --> D --> B(h-1); D --> new --> E(h-1/h-2); A --> C(h-1); new --> F(h-1/h-2); ```

```mermaid graph TD; A(危机) --> F[new]; F --> D --> E(h-1); D --> B(h-1/h-2); F --> G(h-2/h-1); A --> C(h-1); ```

```mermaid graph TD; F --> D --> E(h-1); F[new] --> A(危机) --> G(h-2/h-1); D --> B(h-1/h-2); A --> C(h-1); ```

```mermaid graph TD; A(危机) --> B(h+1 --> h); A --> C --> D(h+1); C --> E(h+1) ```

```mermaid graph TD; F[树高不变]; C --> A(危机) --> h; A --> D(h+1); C --> E(h+1); ```

```mermaid graph TD; A(危机) --> B(h+1 --> h); A --> C --> D(h+1); C --> E(h+1) ```

```mermaid graph TD; F[树高不变]; C --> A(危机) --> h; A --> D(h+1); C --> E(h+1); ```

```mermaid graph TD; A(危机) --> B(h+1 --> h); A --> C --> h; C --> h+1; ```

```mermaid graph TD; F[树高变了]; C --> A(危机) --> h; A --> D(h); C --> E(h+1); ```

```mermaid graph TD; A(危机) --> B(h+1 --> h); A --> C --> D --> E(h); C--> F(h); D --> G(h-1); ```

```mermaid graph TD; G[树高变了]; D --> A(危机) --> B(h+1 --> h); A --> F(h); D --> C --> h-1; C --> h; ```