Tree, forest

table of Contents

One, binary tree

Second, the polytree

Three, the forest

Fourth, the child brother notation

---

One, Binary tree

Binary tree  https://blog.csdn.net/nameofcsdn/article/details/114459069

Full Binary Tree, Full Binary Tree, Perfect Binary Tree  https://blog.csdn.net/nameofcsdn/article/details/114559547

Complete binary tree  https://blog.csdn.net/nameofcsdn/article/details/114270725

Binary Search Tree (BST)  https://blog.csdn.net/nameofcsdn/article/details/114281344

The best binary tree (Huffman tree)  https://blog.csdn.net/nameofcsdn/article/details/114504296

The best binary search tree  https://blog.csdn.net/nameofcsdn/article/details/114504382

Balanced binary tree (AVL tree)  https://blog.csdn.net/nameofcsdn/article/details/114372257

Binary heap  https://blog.csdn.net/nameofcsdn/article/details/113484808

Line segment tree https://blog.csdn.net/nameofcsdn/article/details/115140781

Tree array  https://blog.csdn.net/nameofcsdn/article/details/115216141

Red-black tree https://blog.csdn.net/nameofcsdn/article/details/115319186

 

Second, the polytree

Dictionary tree (Trie, prefix tree)  https://blog.csdn.net/nameofcsdn/article/details/112343283

Radix tree  https://blog.csdn.net/nameofcsdn/article/details/115260905

Binomial tree  https://blog.csdn.net/nameofcsdn/article/details/115375700

 

Three, the forest

And check the collection  https://blog.csdn.net/nameofcsdn/article/details/115123576

 

Fourth, the child brother notation

Any tree can be transformed into a binary tree through child brother notation.