构造一棵二叉树、释放二叉链表中各结点的存储空间、获取指向二叉树根结点的指针、前序遍历二叉树、中序遍历二叉树、后序遍历二叉树等的编程-Construct a binary tree, the release of storage space for each node in the binary list, access points to the binary tree root pointer, before traversing Binary inorder binary tree trav

常用的算法经典代码，包括快速排序，冒泡排序等各种排序方法，还有二叉树的前序、中序和后序遍历等-The classic algorithm code, including quick sort and bubble sort sorting methods, as well as the preamble of the binary tree, inorder and postorder traversal, etc.

关于二叉树先序、中序、后序递归与非递归遍历的详细源代码，并附有详细的注解。适合学习数据结构二叉树的同学学习。-About Binary preorder, inorder, postorder recursive and non-recursive traversal detailed source code, together with detailed notes. Binary tree data structure for learning students learn.