- 0
Compare Two Binary Search Trees
-
Recently Browsing 0 members
- No registered users viewing this page.
-
Posts
-
By Usama Jawad96 · Posted
OpenAI asks employees to reject Meta's "ridiculous" poaching offers in stern memo by Usama Jawad OpenAI is the place to be right now, especially for prolific engineers who are willing to join CEO Sam Altman in the quest for Artificial General Intelligence (AGI). It seems that its rivals have recognized that OpenAI's biggest strength is its employees too, and there have been multiple reports that Meta is poaching its staffers. In fact, Altman himself mentioned recently that Meta is hiring his company's members by offering them up to $100 million in signing bonuses. The company obviously isn't pleased with this situation and has asked its staffers in an internal memo to reject any advances from Meta in the weeks to come. Wired (paywall) reports that OpenAI's Chief Research Officer Mark Chen has published a memorandum in the company's Slack, likening the poaching situation to someone breaking into OpenAI's home and stealing from them. Chen further stated that he will be working with senior leadership including Altman to figure out ways to reward employees with Meta offers in hand with financial compensation and even adjust their overall compensation figures. That said, the executive emphasized that his primary aim is to retain top talent. Chen also quoted messages from seven other senior members of OpenAI's research team with guidance about how to tackle the situation if Meta tries to hire them. One of the advice included asking Meta recruiters to back off if they try to pressurize them with "ridiculous" offers. It is important to note that OpenAI employees have reportedly been struggling with intensive 80-hour work-weeks recently and the company will largely experience a shutdown period next week so that its staffers can recharge. OpenAI believes that this period is also vulnerable for its members as Meta will likely ramp up its hiring efforts during this break. Chen reminded OpenAI employees that they should focus on their main quest, which is achieving AGI, and that confrontations with Meta during this difficult period are just side quests. It is unclear how responsive OpenAI staffers will be to the memo's instructions in the coming days, especially when stacking it up against the reported multi-million compensation offers from Meta. Zuckerberg is even reaching out to some OpenAI employees personally, with the most recent report indicating that Meta had hired four senior OpenAI researchers for its superintelligence lab. -
By margrave · Posted
Everyone should just drop javascript anyway -
By DentedAphid7 · Posted
Exactly. Use it is fine, but copyright is another story... -
By ad47uk · Posted
Not really, I am pretty hot at the moment and tomorrow I will be even hotter as the U.K are some hot days. Not looking forward to work. I just don't want to connect my computer to MS servers, I have no need to, the same with my Mac not being connected to Apple Servers. I have no need for MS or Apple accounts. -
By thartist · Posted
Really? Do you want it spelled out? Ok: It was a funsies way to say that we can confidently asume that their update servers were shut down years ago already, and no updates have been developed or delivered to any LG phone in years, since, to begin, LG wasn't too well known for their software support.
-
-
Recent Achievements
-
Primey_ went up a rank
Community Regular
-
Gromvar earned a badge
Reacting Well
-
BreakingBenjamin earned a badge
Dedicated
-
Hartej earned a badge
Week One Done
-
TsunadeMama earned a badge
One Year In
-
-
Popular Contributors
-
Tell a friend
Question
Jebadiah
I have been trying to figure out a way to compare two Binary Search Trees without multi-threading or any other such parallel computing means. The goal is to test the equivalence of two Binary Search Trees.
The definition of equivalence here is that the number of nodes must be same, and values contained in the two trees must be equal.
For example, see the attached image for two equivalent trees. Now, how would you test the equivalence of these programmatically?
One method I know of is to traverse the tree using any of the traversal methods - Inorder, Preorder, Postorder, etc. and then compare the results with the other tree's. One may even use a BFS or DFS algorithm.
Any other more efficient ways you can think of doing this?
PS: I am NOT in school. This is NOT a homework assignment. I graduated 3 years ago and I am brushing up on data structures. So please keep an open mind. Thanks!
Link to comment
https://www.neowin.net/forum/topic/847418-compare-two-binary-search-trees/Share on other sites
9 answers to this question
Recommended Posts