Menu
I'm looking for a built-in Binary Search Tree implementation in .NET 4. Is there one?
606
To find an element in a Binary Search Tree, we first need to compare the element with the root node; if it matches then we have the right node otherwise we need to check the left or right. The C# implementation of that same is as follows. The following is the test result of the implementation.
A binary tree is a tree in which each node has exactly two children, either of which may be empty. For example, the following is a binary tree: Note that some of the nodes above are drawn with only one child or no children at all. In these cases, one or both children are empty.
Insertion in Binary Search treeTo insert an element in BST, we have to start searching from the root node; if the node to be inserted is less than the root node, then search for an empty location in the left subtree. Else, search for the empty location in the right subtree and insert the data.
Binary Tree ImplementationA Binary tree is implemented with the help of pointers. The first node in the tree is represented by the root pointer. Each node in the tree consists of three parts, i.e., data, left pointer and right pointer. To create a binary tree, we first need to create the node.
The SortedDictionary<K,V> class uses a Tree, is that what you're after?
See this SO answer for a discussion.
53
You could use SortedDictionary<TKey, TValue>
24
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
