Binary Tree Algorithms: There are many types of data structures defined by the pioneer programmers in the past the direct interface to them datastructures have been an imperative but today datastructure have been taken for granted.

There are many types of data structures defined by the pioneer programmers in the past the direct interface to them datastructures have been an imperative but today datastructure have been taken for granted. From the most basic stacks and queues to the more advanced linklist and binary trees. each plays an important role in the life of a computer.

In the binary tree algo I have submitted I have showed the use of the binary tree in terms of sorting and searching. Indeed binary tree is a most useful datastructure and have always been my favourite prior to the very impt stack.