tag:blogger.com,1999:blog-6605110739831561983.post8697009037569625773..comments2023-05-19T06:20:57.916-07:00Comments on Algorithms and Data Structures - Coding, Interviews, Google, Amazon, Microsoft, Apple, IBM: Binary Tree - sum of two nodes (Google Interview Question)Ivan Kadiyskihttp://www.blogger.com/profile/16028324970371404209noreply@blogger.comBlogger7125tag:blogger.com,1999:blog-6605110739831561983.post-90829382782515725962019-03-23T00:10:33.388-07:002019-03-23T00:10:33.388-07:00A Computer Science portal for geeks. It contains w...A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.<br />website: geeksforgeeks.orgAnonymoushttps://www.blogger.com/profile/13461929216402208497noreply@blogger.comtag:blogger.com,1999:blog-6605110739831561983.post-67775745225610551462019-03-19T23:52:21.303-07:002019-03-19T23:52:21.303-07:00A Computer Science portal for geeks. It contains w...A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.<br />website: geeksforgeeks.org<br />pslv seoa10https://www.blogger.com/profile/09705572938556903489noreply@blogger.comtag:blogger.com,1999:blog-6605110739831561983.post-68556220239747975402019-03-15T05:25:36.097-07:002019-03-15T05:25:36.097-07:00A Computer Science portal for geeks. It contains w...A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.<br />website: geeksforgeeks.orgpslvseo a1https://www.blogger.com/profile/10452982623540266379noreply@blogger.comtag:blogger.com,1999:blog-6605110739831561983.post-85942273531187209192019-03-13T01:52:44.835-07:002019-03-13T01:52:44.835-07:00A Computer Science portal for geeks. It contains w...A Computer Science portal for geeks. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.<br />website: geeksforgeeks.orgpslvseo a1https://www.blogger.com/profile/10452982623540266379noreply@blogger.comtag:blogger.com,1999:blog-6605110739831561983.post-11781643012080264542014-09-11T01:19:08.279-07:002014-09-11T01:19:08.279-07:00This comment has been removed by a blog administrator.otr214424https://www.blogger.com/profile/09650602018446443173noreply@blogger.comtag:blogger.com,1999:blog-6605110739831561983.post-16894629255399980802013-07-01T01:50:58.911-07:002013-07-01T01:50:58.911-07:00Yes, it is true. In case you don't have the re...Yes, it is true. In case you don't have the restriction "Additional space: O(height of the tree)" this will be a good solution with an easy implementation.Ivan Kadiyskihttps://www.blogger.com/profile/16028324970371404209noreply@blogger.comtag:blogger.com,1999:blog-6605110739831561983.post-59763406350469062982013-06-29T14:00:15.192-07:002013-06-29T14:00:15.192-07:00Saving all the elements in an array and then scann...Saving all the elements in an array and then scanning from two ends would be easy to implement I think. Anonymoushttps://www.blogger.com/profile/11232776615158405346noreply@blogger.com