Skip to main content

Tree Traversals

Problem​

You have been given a Binary Tree of 'N' nodes, where the nodes have integer values. Your task is to find the ln-Order, Pre-Order, and Post-Order traversals of the given binary tree.

Solution Approach​

Expected Time complexity: O(n)O(n)

Click - to see solution code
void traverse(BinaryTreeNode<int> *root, vector<int> &pre, vector<int> &in,
              vector<int> &post) {
    if (!root) return;
    pre.push_back(root->data);
    traverse(root->left, pre, in, post);
    in.push_back(root->data);
    traverse(root->right, pre, in, post);
    post.push_back(root->data);
}

vector<vector<int>> getTreeTraversal(BinaryTreeNode<int> *root) {
    vector<int> pre, in, post;
    traverse(root, pre, in, post);
    return {in, pre, post};
}