FilesExpand file tree

 master

/

94.cpp

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

41 lines (38 loc) · 741 Bytes

 master

/

94.cpp

Copy path

Top

File metadata and controls

• Code
• Blame

41 lines (38 loc) · 741 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

#include "stdafx.h"

#include <vector>

#include <stack>

#include <algorithm>

#include <iostream>

using namespace std;

/*

94. ¶þ²æÊ÷µÄÖÐÐò±éÀú

https://leetcode-cn.com/problems/binary-tree-inorder-traversal/description/

*/

/*Definition for a binary tree node.*/

//struct TreeNode {

// int val;

// TreeNode *left;

// TreeNode *right;

// TreeNode(int x) : val(x), left(NULL), right(NULL) {}

//};

class Solution {

public:

vector<int> inorderTraversal(TreeNode* root) {

stack<TreeNode*> s;

vector<int> vec;

TreeNode* p = root;

while (!s.empty()||p!=nullptr)

{

while (p!=nullptr)

{

s.push(p);

p = p->left;

}

p = s.top();

s.pop();

vec.push_back(p->val);

p = p->right;

}

return vec;

}

};