Introduction - If you have any usage issues, please Google them yourself
Programming storage structure and basic algorithms binary tree, including the following features: create binary chain binary B binary B' s: A (B (D, E (H (J, K (L, M (, N)))) ), C (F, G (, I))) B through binary operation generalized table output binary tree B (strings) by binary expression B operation, the output of H nodes left child and right children B through binary operation, the depth of a binary tree B B through binary operation to calculate the number of nodes of a binary tree B B through binary operation to calculate the number of leaf nodes of the binary tree B by binary tree B operation, first order output binary tree B traversal sequence through the binary tree B operation, the output of a binary tree B of traversal sequence through the binary tree B operation, after the sequence output binary tree B traversal sequence release binary Tree B