Esempi in C++ (Cpp) per levelOrderHelper

Esempio n. 1

File: 107_BinaryTreeLevelOrderTraversalII.cpp Progetto: bashell/leetcode

 void levelOrderHelper(TreeNode* root, int level, vector<vector<int>> &res) {
     if(root == NULL) return;
     if(res.size() == level)
         res.push_back(vector<int>{});
     res[level].push_back(root->val);
     levelOrderHelper(root->left, level+1, res);
     levelOrderHelper(root->right, level+1, res);
 }

Esempio n. 2

File: 107_BinaryTreeLevelOrderTraversalII.cpp Progetto: bashell/leetcode

 vector<vector<int>> levelOrderBottom(TreeNode* root) {
     vector<vector<int>> res;
     if(root == NULL) return res;
     levelOrderHelper(root, 0, res);
     return vector<vector<int>> {res.rbegin(), res.rend()};
 }

Esempio n. 3

File: Tree.hpp Progetto: siidney/Cpp-How-To-Program-9E

void Tree<NODETYPE>::levelOrderTraversal() const {
    levelOrderHelper(rootPtr);
    std::cout << std::endl;
}  // end method levelOrderTraversal