Inorder traversal of a Binary tree can either be done using recursion or with the use of a auxiliary stack. The idea of threaded binary trees is to make inorder traversal faster and do it without ...

The idea of threaded binary trees is to make inorder traversal faster and do it without stack and without recursion. A binary tree is made threaded by making all right child pointers that would ...

Okay, let me say from the start that I'm not trying to get anybody to do my homework for me. I'm looking for pointers to information, not trying to wheedle ...

Both a sorted array and a binary tree can let you look up an element in log(N) time. However I would expect a sorted array to be faster in practice because of the constant factor.