Binary search tree is a type of binary tree with a special arrangement of data. BJT as either empty a contain a data value that sptities the following properties .
Every element has a unique key.
The left and right subtree and also binary search tree.
All the data value in the left subtree are smaller than the data value in the root.
It is type of binary tree that maintains a specific ordering property to allow for efficient searching, insertion, and deletion is called Binary Search Tree (BST) .
We use cookies to enhance your experience, to provide social media features and to analyse our traffic. By continuing to browse, you agree to our Privacy Policy.
2 Answer
Shyam singh . 2 weeks ago
Binary search tree is a type of binary tree with a special arrangement of data. BJT as either empty a contain a data value that sptities the following properties .
Rajanshahi thakuri . 2 weeks ago