There are a couple of advantages : 1. efficiently determine the predecessor and successor nodes starting from any node. 2. Any node can be accessible from any other node.
Many problems on tree use recursion / stack to solve But if the same problem when solved using threaded binary tree gives a solution in O(n) and space O(1) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
