What are the operations of binary tree? Explain.
Answers
Answered by
0
The idea of a binary search tree is that data is stored according to an order, so that it can be retrieved very efficiently.
A BST is a binary tree of nodes ordered in the following way:
Each node contains one key (also unique) The keys in the left subtree are < (less) than the key in its parent node.
thanks
A BST is a binary tree of nodes ordered in the following way:
Each node contains one key (also unique) The keys in the left subtree are < (less) than the key in its parent node.
thanks
Similar questions