this code for tree linked list. you can create node. and then yo can look child of data from root.

求二叉树的高度与结点，判断两颗二叉树是否相识-Find the height and node binary tree, binary tree to determine whether the two met

赫夫曼树：试构造一棵有n个叶子结点的二叉树，每个叶子节点带权为wi，则期中带权路径wpl的最小的二叉树-Huffman Tree: test construct an n-leaf nodes are the binary tree, each leaf node with a right to wi, then the period of the right path with the smallest binary tree wpl