binary-search-tree

问题 I'm struggling with the concept of when to use binary search trees and when to use dictionaries. In my application I did a little experiment which used the C5 library TreeDictionary (which I believe is a red-black binary search tree), and the C# dictionary. The dictionary was always faster at add/find operations and also always used less memory space. For example, at 16809 <int, float> entries, the dictionary used 342 KiB whilst the tree used 723 KiB. I thought that BST's were supposed to be

问题 How many binary search trees can be constructed from n distinct elements? And how can we find a mathematically proved formula for it? Example: If we have 3 distinct elements, say 1, 2, 3, there are 5 binary search trees. 回答1: Given n elements, the number of binary search trees that can be made from those elements is given by the nth Catalan number (denoted C n ). This is equal to Intuitively, the Catalan numbers represent the number of ways that you can create a structure out of n elements

问题 What are the main differences between a Linked List and a BinarySearchTree? Is BST just a way of maintaining a LinkedList? My instructor talked about LinkedList and then BST but did't compare them or didn't say when to prefer one over another. This is probably a dumb question but I'm really confused. I would appreciate if someone can clarify this in a simple manner. 回答1: Linked List: Item(1) -> Item(2) -> Item(3) -> Item(4) -> Item(5) -> Item(6) -> Item(7) Binary tree: Node(1) / Node(2) / \ /

问题 I have always assumed that std::lower_bound() runs in logarithmic time if I pass a pair of red-black tree iterators ( set::iterator or map::iterator ) to it. I had to burn myself twice to notice that std::lower_bound() runs in O(n) time in this case, at least with the libstdc++ implementation. I understand that the standard doesn't have the concept of red-black tree iterators; std::lower_bound() will treat them as bidirectional iterators and advance them in linear time. I still don't see any

问题 Here is the implementation of RedBlackTree I am using (from Mark Allen Weiss, Data Structures public class RedBlackTree<AnyKey extends Comparable<? super AnyKey>, AnyValue extends Comparable<? super AnyValue>> implements MyTreeMap<AnyKey, AnyValue>{ private static final int BLACK = 1; private static final int RED = 0; // The psuedo(bogus) root, has a key value of negative infinity and a right link to the real root. private RedBlackNode<AnyKey, AnyValue> header; // Used in place of a null link

问题 I need to send an email to users based wherever in the world at 9:00 am local time. The server is in the UK. What I can do is set up a time difference between each user and the server's time, which would then perfectly work if DST didn't exist. Here's an example to illustrate it: John works in New York, -5 hours from the server (UK) time Richard works in London, UK, so 0 hour difference with the server. When the server goes from GMT to GMT +1 (BST) at 2:00am on a certain Sunday, this means

问题 The problem: Given a particular sequence of up to 50 integers, which represent nodes of a certain binary search tree (BST), how many permutations of this sequence are there, which will also give rise to exactly the same BST? Include the original sequence in your total count as 1 sequence. For instance, answer = 6 for such a sequence [5,2,1,9,8]: [5,2,1,9,8] (itself, the original sequence given), [5,9,8,2,1], [5,2,9,1,8], [5,9,2,1,8], [5,2,9,8,1], [5,9,2,8,1] 回答1: Suppose you have your example

问题 It's difficult to tell what is being asked here. This question is ambiguous, vague, incomplete, overly broad, or rhetorical and cannot be reasonably answered in its current form. For help clarifying this question so that it can be reopened, visit the help center. Closed 6 years ago . I am trying to make a binary search tree using C++. I am using only the functions to insert data and find data. I can't seem to get the program to work, although I find that it is very logic and correct? Any help

问题 I would like to know the most efficient way to delete an entire binary search tree. also not to let any memory leak so having to check if all the nodes in the sub trees are deleted first. I cant think of any efficient way besides post order traversal, deleting as you go. any suggestions or ideas? 回答1: Just set your root node as null . Let the garbage collector to do its job. 回答2: Deleting all leaves from a binary tree thread discusses about deleting all children of binary tree. public static

问题 I am confused on the recursion in binary search tree transversals, I'm just lost since i need to return a list at the end and don't get how to save the values.It adds values like this shown below and I don't get what data stype is used to save the values like that also I don't think I'm moving through the tree correctly here is my code for , not sure if my unittest is correct either def inorder(self): print("IN INORDER_______________________________") print("Printing self.value" + str(self._