Describe binary tree traversal? explain threaded binary tree with an example in hindi
Answers
Answered by
0
Binary trees, including (but not limited to) binary search trees
and their variants, can be used to store a set of items in a particular
order. For example, a binary search tree assumes data items are somehow
ordered and maintain this ordering as part of their insertion and
deletion algorithms. One useful operation on such a tree is traversal: visiting the items in the order in which they are stored (which matches the underlying ordering in the case of BST).
Attachments:
Similar questions