二叉树有左右结点之分,不存在度>2的结点
typedef struct Node
{
int num;
struct Node *lchild;
struct Node *rchild;
}TreeNode, *Tree;
//Tree->Node类型
int main()
{
Tree p=NULL; //p->Node type=NULL √ 给p初始化为NULL
Tree T1 = p; //T1->Node type=p=NULL √ 仅仅是将p赋给了T1
Tree T2 = &p; //T2->Node type=&p(&p is not Node)
Tree *T3 = p; //T3->Tree type->Node type
Tree *T4 = &p; //T4->Tree type->Node type √ 传参数使用,可以改变值
return