Leetcode/BinaryTreeLevelOrderTraversal.cpp.save at master · Jessicahust/Leetcode · GitHub

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
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
#include<iostream>
#include<new>
#include<vector>
using namespace std;

//Definition for binary tree
struct TreeNode
{
    int val;
    TreeNode *left;
    TreeNode *right;
    TreeNode(int x) : val(x), left(NULL), right(NULL) {}
};

class Solution {
public:
    vector<vector<int> > levelOrder(TreeNode *root) {
        vector<vector<int> > vec;
        vector<vector<TreeNode*> > rvec;
        int i=0;
        if(root==NULL)
            return vector<vector<int> >();
        vec[0].push_back(root->val);
        vec[0].push_back(root);
        if(vec.size())
        {
            for(i=0;i<vec[vec.size()-1].size();i++)
            {
                TreeNode *tmp=rvec[rvec.size()-1][i];
                if(tmp->left)
                {
                    vec[]
                }
            }
        }
        return vec;
    }
    void createTree(TreeNode *&root)
    {
        int i;
        cin>>i;
        if(i!=0)
        {
            root=new TreeNode(i);
            if(root==NULL)
                return;
            createTree(root->left);
            createTree(root->right);
        }
    }
};

int main()
{
    Solution s;
    TreeNode *root;
    s.createTree(root);
}