标签：data order span class nod type int 非递归 har
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); }
//非递归方法待完善
Binary Tree Preorder Traversal
标签：data order span class nod type int 非递归 har
原文地址：https://www.cnblogs.com/hujianglang/p/11421184.html
