I code level order for BST.

Can anyone help this for bottom level order?

void printLevelOrderHelper(Node *root) {

queue*> q;

if (root == NULL)

return; //empty

// Create an empty queue

// Enqueue Root and initialize height

q.push(root);

while (q.empty() == false)

{

// Print front of queue and remove it from queue

Node *root = q.front();

cout << root->value << " ";

q.pop();

/* Enqueue left child */

if (root->left != NULL)

q.push(root->left);

/*Enqueue right child */

if (root->right != NULL)

q.push(root->right);

}

out << endl;

}

vector & returnLevelOrderHelper(Node *root) {

vector * ret = new vector{};

// need to build bottomlevelorder here

}