二叉树的建立、删除及三种遍历的C++实现

教材上的Tree类写法太累赘࿰c;不实用࿰c;将树节点直接写成结构体即可

要理解结点的含义以及根结点的重要意义

ce; font-size:13px">c</a>ode" <a class="tags" href="/tags/C.html" title=c>c</a>lass="<a class="tags" href="/tags/C.html" title=c>c</a>pp">#in<a class="tags" href="/tags/C.html" title=c>c</a>lude <stdio.h> #in<a class="tags" href="/tags/C.html" title=c>c</a>lude <stdlib.h> //用CPP文件编写࿰<a class="tags" href="/tags/C.html" title=c>c</a>;否则编译出错࿰<a class="tags" href="/tags/C.html" title=c>c</a>;需要加<a <a class="tags" href="/tags/C.html" title=c>c</a>lass="tags" href="/tags/STRUCT.html" title=stru<a class="tags" href="/tags/C.html" title=c>c</a>t>stru<a class="tags" href="/tags/C.html" title=c>c</a>t</a>且<a <a class="tags" href="/tags/C.html" title=c>c</a>lass="tags" href="/tags/DELETE.html" title=delete>delete</a>不识别 <a <a class="tags" href="/tags/C.html" title=c>c</a>lass="tags" href="/tags/STRUCT.html" title=stru<a class="tags" href="/tags/C.html" title=c>c</a>t>stru<a class="tags" href="/tags/C.html" title=c>c</a>t</a> TreeNode { int val; TreeNode * left, * right; }; TreeNode * insertTree(TreeNode * root,int val){//insert new node,return root TreeNode * newNode; if (root == NULL) { newNode = new TreeNode; newNode -> val = val; newNode -> left = NULL; newNode -> right = NULL; return newNode; } if (val < root ->val) root ->left = insertTree(root ->left,val); else root ->right = insertTree(root ->right,val); return root; } void delTree(TreeNode * root){ if(root -> left != NULL) delTree(root -> left); if(root -> right != NULL) delTree(root ->right); <a <a class="tags" href="/tags/C.html" title=c>c</a>lass="tags" href="/tags/DELETE.html" title=delete>delete</a> root; return; } void FLRTraverse(TreeNode * root) {//先序遍历 printf("%d/n",root -> val); if(root -> left != NULL) FLRTraverse(root -> left); if(root -> right != NULL) FLRTraverse(root -> right); return; } void LFRTraverse(TreeNode * root) {//中序遍历 if(root -> left != NULL) LFRTraverse(root -> left); printf("%d/n",root -> val); if(root -> right != NULL) LFRTraverse(root -> right); return; } void LRFTraverse(TreeNode * root) {//后序遍历 if(root -> left != NULL) LRFTraverse(root -> left); if(root -> right != NULL) LRFTraverse(root -> right); printf("%d/n",root -> val); return; } void main(){ //始终记住根是对树而言最重要的结点 FILE * fin; TreeNode *root; int val; fin = fopen("data.txt","r"); root = NULL; while(fs<a class="tags" href="/tags/C.html" title=c>c</a>anf(fin,"%d",&val) != EOF) root = insertTree(root,val); f<a class="tags" href="/tags/C.html" title=c>c</a>lose(fin); printf("先序遍历:/n"); FLRTraverse(root); printf("/n"); printf("中序遍历:/n"); LFRTraverse(root); printf("/n"); printf("后序遍历:/n"); LRFTraverse(root); printf("/n"); delTree(root); return; }