Help in question related to treeTree challenge from Kodecrypt 2021 round 2 on hackerrank.
Difference between en1 and en2, changed 48 character(s)
This [question](https://www.hackerrank.com/contests/kodecrypt-2021-round-2-slot-4/challenges/the-tree-challenge) appeared in a contest on hacerrank.↵
↵
Any ideas on how to solve this tree problem efficiently? I got only 57.14 points with my binary search and preorder-pattern matching approach.↵
↵
[Here's my approach](https://pastebin.com/JgwawE4z)↵
↵
I'm asking for your help and approach because no submissions are available to see.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Living_Tribunal 2021-05-07 17:20:19 48
en1 English Living_Tribunal 2021-05-07 16:17:40 482 Initial revision (published)