[XJTUSE] data structure learning -- 3.4 binary search tree
3.4 binary search tree
The function of binary search tree
one ️⃣ Provides the ability to find elements that take logn time
two ️⃣ Provides the ability to insert and delete elements taking logn time
For 10000 data
■ using a linear table to find elements requires an average of 5000 comparisons
■ using binary search tree to find el ...
Posted by Hoangsta on Sat, 05 Feb 2022 10:32:57 +0100
Principle analysis and code implementation of BST (binary search tree)
brief introduction
As a classical data structure, binary search tree not only has the characteristics of fast insertion and deletion of linked list, but also has the advantage of fast search of array;
Introduction to binary search tree
Binary Search Tree: BST (Binary Search Tree), for any non leaf node of the Binary Search Tree. The valu ...
Posted by Unipus on Fri, 28 Jan 2022 00:55:25 +0100