Solution Class Reference

Public Member Functions
vector< vector< int > >	levelOrder (TreeNode *root)

Detailed Description

Definition at line 19 of file main.cpp.

Member Function Documentation

levelOrder()

vector< vector< int > > Solution::levelOrder ( TreeNode *  root )

inline

Definition at line 22 of file main.cpp.

    {
        vector<vector<int>> answer = {};
        if (root)
        {
            queue<pair<TreeNode*, int>> node_queue; // the first is the node, the second is a level
            node_queue.push({root, 0});
            while (!node_queue.empty())
            {
                TreeNode* current = node_queue.front().first;
                int level = node_queue.front().second;
                node_queue.pop();
                
                if ((int)answer.size() > level)
                    answer[level].push_back(current->val);
                else
                    answer.push_back(vector<int>{current->val});
 
                level++;
                if (current->left)
                    node_queue.push({current->left, level});
                if (current->right)
                    node_queue.push({current->right, level});
            }
        }
        return answer;
    }

References TreeNode::left, TreeNode::right, and TreeNode::val.

Referenced by main().

---

The documentation for this class was generated from the following file:

• main.cpp