## References

- 1. N. Aghaieabiane, H. Koppelaar, P. Nasehpour (2017). An improved algorithm to reconstruct a binary tree from its inorder and postorder traversals. Journal of algorithms and computation. vol. 49, no. 1, pp. 93–113.
- 2. V. V. Das (2010). A New Non-recursive Algorithm for Reconstructing a Binary Tree from its Traversals. 2010 International Conference on Advances in Recent Technologies in Communication and Computing, Kottayam, pp. 261–263. doi: 10.1109/ARTCom.2010.88
- 3. Find first set. Wikipedia article. retrieved January 14, 2019. https://en.wikipedia.org/wiki/Find_first_set
- 4. T. Gagie (2003). New Ways to Construct Binary Search Trees. In: Ibaraki T., Katoh N., Ono H. (eds) Algorithms and Computation. ISAAC 2003. Lecture Notes in Computer Science, vol. 2906, Springer, Berlin, Heidelberg.
- 5. D. E. Knuth (1973). The art of computer programming: Sorting and searching., vol. 3. Reading, Mass.: Addison-Wesley Pub. Co.
- 6. Sorted List to complete BST. Rhyscitlema. July 31, 2018. retrieved February 22, 2019. http://rhyscitlema.com/algorithms/sorted-list-to-complete-bst/
- 7. C. J. Stephenson (1980). A method for constructing binary search trees by making insertions at the root. Int. J. Comput. Inf. Sci. 9, pp. 15–29.
- 8. J. G. Vaucher (2004). Building optimal binary search trees from sorted values in O(N) time. In: Essays in Memory of Ole-Johan Dahl, pp. 376–388.
- 9. N. Wirth (1976). Algorithms + data structures = programs. Englewood Cliffs, N.J.: Prentice-Hall.

Comments

There are no comments yet.