Binary search tree of knowledge Summary

• The first preamble is the root of the whole tree
• After the last sequence is the root of the whole tree
• In order to divide the left and right subtrees is determined
• The first preamble sequence of a node in the left subtree is the root portion of the left subtree
• The first preamble sequence node right subtree of the root portion is a right subtree
• Features of preamble sequence should be seen immediately behind the root is the root of the left subtree

• First order binary tree, in order, the sequence preorder https://blog.csdn.net/qq_34840129/article/details/80619761

• https://blog.csdn.net/ac_blood/article/details/77047877