< Back to forum

Practice

Question link: https://www.hackerearth.com/practice/data-structures/trees/binary-and-nary-trees/practice-problems/algorithm/gandhi-tree-march/description/

i am having difficulty in writing the code..i am thinking about implementing it with stack.

tree

Asked by: Samrat_De on April 7, 2019, 6:34 p.m. Last updated on April 7, 2019, 6:34 p.m.

Enter your answer details below:


Enter your comment details below:




1 Answer(s)

avatar

I guess you have found out how the tree is built...

Now you just have to traverse the tree....By maintaining a column counter ...

and maintain a map of type <int,vector<char>> globally....

Now before Moving to the left subtree decrease the counter by 1 and after the left subbranch is completed and you backtrack to the same function increase the counter again(as you reach the same node).... same goes for the right subtree(increase it first and then decrease it when you backtrack the recursion)...

And as you visit the nodes ...add the nodes to the map to the key equal to the value of counter...

Hope this helps...

Shubham_Gupta last updated on April 7, 2019, 6:34 p.m. 0    Reply    Upvote   

Instruction to write good question
  1. 1. Write a title that summarizes the specific problem
  2. 2. Pretend you're talking to a busy colleague
  3. 3. Spelling, grammar and punctuation are important!

Bad: C# Math Confusion
Good: Why does using float instead of int give me different results when all of my inputs are integers?
Bad: [php] session doubt
Good: How can I redirect users to different pages based on session data in PHP?
Bad: android if else problems
Good: Why does str == "value" evaluate to false when str is set to "value"?

Refer to Stack Overflow guide on asking a good question.