二叉树的DFS遍历(递归)

二叉(搜索)树的实现

代码如下：

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

#include <iostream>
using namespace std;
struct treeNode {
    int val;
    int position;
    treeNode* left;
    treeNode* right;
    treeNode(int val,int position){
        this->val = val;
        this->position = position;
        this->left = nullptr;
        this->right = nullptr;
    }
};


class BinaryTree {
public:
  treeNode* root = nullptr;
  BinaryTree(){
      root = nullptr;
  }
  pre_order(treeNode* node);
  mid_order(treeNode* node);
  back_order(treeNode* node);
};

先序遍历

代码如下：

1
2
3
4
5
6
7
8
9
10
11
12

/**
*前序遍历
**/
    void BinaryTree::pre_order(treeNode* node){
        if (node==nullptr) {
            return;
        }else{
            cout<<node->val<<endl;
            pre_order(node->left);
            pre_order(node->right);
        }
    }

中序遍历

代码如下：

1
2
3
4
5
6
7
8
9
10
11
12

/**
*中序遍历
**/
    void BinaryTree::mid_order(treeNode* node){
        if (node==nullptr) {
            return;
        }else{
           mid_order(node->left);
            cout<<node->val<<endl;
            mid_order(node->right);
        }
    }

后序遍历

代码如下：

1
2
3
4
5
6
7
8
9
10
11
12

/**
*后序遍历
**/
    void BinaryTree::back_order(treeNode* node){
        if (node==nullptr) {
            return;
        }else{
           back_order(node->left);
            back_order(node->right);
            cout<<node->val<<endl;
        }
    }

Comments