tag:blogger.com,1999:blog-6849619265483407528.post3728384255050695214..comments2024-11-09T05:35:34.649-08:00Comments on Programming Interview Questions and Answers: Lost in a Forest of TreesNikhil Singhalhttp://www.blogger.com/profile/03662183414943720702noreply@blogger.comBlogger4125tag:blogger.com,1999:blog-6849619265483407528.post-61764515628820220552021-12-15T00:09:19.723-08:002021-12-15T00:09:19.723-08:00I think this is a charming issue, I expect you wou...I think this is a charming issue, I expect you would surely post on it again sometime near the future. Thanks guys!<br /><a href="https://underconstructionpage.com/improving-your-business-website-user-experience/" rel="nofollow">interaction design firms</a><br />Petter Johnhttps://www.blogger.com/profile/08884887707262443304noreply@blogger.comtag:blogger.com,1999:blog-6849619265483407528.post-72389442603345882352011-09-14T10:44:14.716-07:002011-09-14T10:44:14.716-07:00To provide an example, using the "binary sear...To provide an example, using the "binary search tree" image posted in the article (the one with 8 as the root node):<br /><br />Say you were looking for a 4. You start searching at the root node, 8. 8 isn't 4, so you compare the values. Since a 4 is smaller than an 8, you'd move to the left node, the 3. Again, 3 isn't 4. Since 4 is larger than 3, you'd move to the right Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-6849619265483407528.post-71844629292849846122011-09-14T10:36:09.851-07:002011-09-14T10:36:09.851-07:00Going with the definition the author provides, no,...Going with the definition the author provides, no, it's not. He states the definition of a binary search tree (BST) incorrectly, and this article is wrong.<br /><br />A BST is a binary tree (a tree in which each node has at most two children, a left node and a right node) with the constraints that a parent node's left child must always have a value smaller than the parent, and the right Anonymousnoreply@blogger.comtag:blogger.com,1999:blog-6849619265483407528.post-82840993576760585612011-08-29T06:59:41.509-07:002011-08-29T06:59:41.509-07:00"This is much more performant than searching ..."This is much more performant than searching through an array of linear data because in an array, you potentially have to touch every element to find what you are looking for."<br /><br />Is this true?Anonymousnoreply@blogger.com