Given a tree and a node, print all ancestors of Node

• Start from the given node and traverse up the tree

• While traversing, keep track of the parent nodes

• Print the parent nodes as you traverse up until re...read more

class Solution{

public:

bool helper(struct Node* root, vector<int> &ans, int target){

if(root==nullptr){

return false;

}

if(root->data==target){

// ans.push_back(root->data);

return true;

}

bool l=hel...read more