i would like to develop a binary tree structure such that every single node stores a key and a linked list. the reason behind such implementation is that i would like to do a search within the binary tree (Binary search tree) with appropriate key and the linked list will serve as storing structure that i could easily retrieve any information at anytime. Can anyone help me on this approach? or if anyone can suggest a better approach would be appreciated.
P.S: Using binary tree is due to performance of searching algorithm O(log n) and the use of linked list is due that the structure has to be dynamic so i cant use arrays since its structure is static.
You should use a Sorted Diccionary: “The SortedDictionary(Of TKey, TValue) generic class is a binary search tree with O(log n) retrieval”, check the documentation :SortedDiccionary