Binary Tree Preorder Traversal
发布时间:2020-12-14 05:08:30 所属栏目:大数据 来源:网络整理
导读:typedef char ElemType;typedef struct BiTreeNode{ ElemType data; struct BiTreeNode * left; struct BiTreeNode * right;}BiTreeNode, * BiTree;Binary Tree Preorder Traversal void TraverseBiTree(BiTree T){ if (T == NULL) return ; printf( " %c "
typedef char ElemType; typedef struct BiTreeNode { ElemType data; struct BiTreeNode *left; struct BiTreeNode *right; }BiTreeNode,*BiTree; Binary Tree Preorder Traversal void TraverseBiTree(BiTree T){ if(T == NULL) return; printf("%c",T->data); TraverseBiTree(T->left); TraverseBiTree(T->right); }//非递归方法待完善 (编辑:李大同) 【声明】本站内容均来自网络,其相关言论仅代表作者个人观点,不代表本站立场。若无意侵犯到您的权利,请及时与联系站长删除相关内容! |