![](https://img-blog.csdnimg.cn/20201014180756926.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
数据结构---二叉树
shmilyzz
这个作者很懒,什么都没留下…
展开
-
Binary Tree Traversals
A binary tree is a finite set of vertices that is either empty or consists of a root r and two disjoint binary trees called the left and right subtrees. There are three most important ways in which th原创 2017-10-21 10:15:37 · 287 阅读 · 0 评论 -
二叉树的前序,中序,后序遍历
#include #include #define ElemType char typedef struct Node { char data; struct Node*LChild; struct Node*RChild; } BiTNode,*BiTree; void GreateBiTree(BiTree *root) { char ch; ch=ge原创 2017-10-21 10:45:53 · 186 阅读 · 0 评论