遍历只做了先序,递归实现的,中序和后序都类似.代码比较简单,就不写注释,直接贴出来了
代码:
TreeNode:结点类
- using System;
- using System.Collections.Generic;
- using System.Text;
- namespace 二叉树的建立和遍历
- {
- class TreeNode
- {
- public char data;
- public TreeNode left, right;
- public TreeNode(char c,TreeNode l,TreeNode r)
- {
- data = c;
- left = l;
- right = r;
- }
- public TreeNode() { left = right = null; }
- }
- }
Tree:树类
- using System;
- using