Question

Difference between binary tree and threaded binary tree

Answer 1

Answer:

In fact, a binary search tree is a concept that has nothing inherently to do with how the tree is implemented, while a threaded tree is only about how trees are implemented--i.e. how you set up the pointers in the tree nodes.

hope you get it....

Answer 2

A binary search tree is a special type of tree , while a threaded tree is only about how trees are implemented.

Explanation:

• A binary search tree may be a special case of a binary search tree, within which the weather satisfy the ordering you mention--everything within the left subtree should be but the foundation node, and everything within the right subtree should be bigger.
• A rib tree does not have any such restrictions, ANd if truth be told a rib tree does not ought to have knowledge within the nodes which will be compared with an ordering relationship.
• In fact, a binary search tree may be a construct that has nothing inherently to try and do with however the tree is enforced, whereas a rib tree is merely concerning however trees square measure implemented--i.e. however you created the pointers within the tree nodes.
• A binary search tree are often a rib tree if you choose to implement it that approach.