tag:blogger.com,1999:blog-4241134051445967500.post6716090263632574589..comments2024-03-13T01:08:34.507-07:00Comments on Coding Recipies: Morris Inorder-TraversalPrateek Rathorehttp://www.blogger.com/profile/04442332907033511811noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-4241134051445967500.post-30139991892170864052016-09-20T00:24:26.406-07:002016-09-20T00:24:26.406-07:00Good post! As far as I know in Binary Search Tree,...Good post! As far as I know in Binary Search Tree, in-order successor of the input node will also be defined as the node with the smallest key which is greater than the key of input node. So sometimes it’s important to search the next node in sorted order.Sarahttp://www.toptrackingapps.comnoreply@blogger.comtag:blogger.com,1999:blog-4241134051445967500.post-47737120715162166352016-08-19T00:27:18.912-07:002016-08-19T00:27:18.912-07:00Excellent approach! Although I can make small modi...Excellent approach! Although I can make small modification to print in-oder predecessor and revert thread, immediately without traversing same left again.Hazelhttp://www.java-forums.org/forum.phpnoreply@blogger.com