Given a sorted binary tree, please find if any duplicate values exist in the tree. Your function\nshould take in the root node, and return true as soon as a duplicate is found\nDuplicate values may either be on the right or left sub-tree - the ordering is not guaranteed \nExamples:  \n```\n              4                       6                          7\n            /   \\                   /   \\                      /   \\\n            3    5                 6     6                    7   10 \n```\n\n*Follow up*: if amount of data is huge - how would you approach a multi-threaded solution?

Given a sorted binary tree, please find if any duplicate values exist in the tree. Your function\nshould take in the root node, and return true as soon as a dup