二叉查找树和哈夫曼树的实现，实现节点的删除（包括根节点的删除，带有两个节点的删除，等），节点的查找，插入。-Binary search trees and Huffman tree, has implemented the deletion of nodes (including the root node is deleted, with two nodes removed, etc.), the node lookup, insertion.