摘要:
二叉树相关问题,在面试中主要通过递归来实现1.二叉树建立/**二叉树建立**/struct Data{ int val;};typedef struct BiNode { Data data; BiNode * left; BiNode * right;}* BiTree;static BiTree binTree;/**先序创建**/void CreateBiTree(BiTree * T){ cout>data->val; if(data->val == 0) { (*T) = NULL; }else { (... 阅读全文