Given a binary tree (values are unique), and a vector of nums\ne.g.\n```\n      0\n    /   \\\n  1      2 \n/   \\\n3   4\n\n```\n\ndetermine the nums is good or bad\n\ngood: the nums position is sorted according to the inorder sequence\nbad: the nums position is not sorted according to the inorder sequence\ne.g.\ninorder of the tree = 3 1 4 0 2\n[1 4 2] -> good\n[3 1 0] -> good\n[3 4 1] -> bad because 4 is after 1 in inorder traversal sequence\n\nI kinda feel that I\'ve seen the same problem in leetcode, anyone knows?

Given a binary tree (values are unique), and a vector of nums\ne.g.\n\n      0\n    /   \\\n  1      2 \n/   \\\n3   4\n\n\n\ndetermine the nums is good or bad\