摘要： 二叉树的插入，前序，中序，后序遍历，递归求深度和节点数View Code #include<stdlib.h>#include<stdio.h>struct tree_el { int val; struct tree_el * right, * left;};typedef struct tree_el node;void insert(node ** tree, node * item) { if(!(*tree)) { *tree = item; return; } if(item->val<=(*tree)->val) inse... 阅读全文