二叉树的存储及遍历

链式存储

#include <iostream>
using namespace std;
typedef int elemtype;
typedef struct treenode *bintree;
struct treenode {
  elemtype data;
  bintree left;
  bintree right;
};

二叉树的遍历

先序遍历

void preordertraversal(bintree bt)
{
  if (bt)
  {
    cout << bt->data<<endl;
    preordertraversal(bt->left);
    preordertraversal(bt->right);
  }
}

中序遍历

每一个都当作根节点

void preordertraversal(bintree bt)
{
  if (bt)
  {
    preordertraversal(bt->left);
    cout << bt->data << endl;
    preordertraversal(bt->right);
  }
}

后序遍历

void preordertraversal(bintree bt)
{
  if (bt)
  {
    preordertraversal(bt->left);
    preordertraversal(bt->right)
        cout << bt->data << endl;;
  }
}