当我们考虑一种更具体的二叉树——二叉搜索树时，识别子结点是很重要的。
Identifying the child nodes is important when we consider a more specific type of binary tree-the binary search tree.
我们利用哈夫曼算法建立一棵哈夫曼树(最优二叉树)，同时将数据出现的频率作为权值赋给哈夫曼树中的结点。
Huffman algorithm we use to establish a Huffman tree (the optimal binary tree), while the frequency of the data as the weights assigned to Huffman tree nodes.
有种特别的树，叫做二叉树，最多只能有两个子结点。
Special types of trees, called binary trees, restrict the number of children to no more than two.
树中的结点最多有两个子结点的树叫做二叉树。
A binary tree is defined as a tree where each node can have no more than two children.
请使用数组输入二叉树的结点数据，以结构体数组表示法创建二叉树，完成后将结构数组内容输出。
Please enter the binary tree using an array of node data, in order to create a structure array representation of binary tree, when completed, will structure the contents of the output array.
请使用数组输入二叉树的结点数据，以结构体数组表示法创建二叉树，完成后将结构数组内容输出。
Please enter the binary tree using an array of node data, in order to create a structure array representation of binary tree, when completed, will structure the contents of the output array.
应用推荐