binary-search-tree

I think that I know the answer and the minimum complexity is O(nlogn) . But is there any way that I can make an binary search tree from a heap in O(n) complexity? There is no algorithm for building a BST from a heap in O(n) time. The reason for this is that given n elements, you can build a heap from them in O(n) time. If you have a BST for a set of values, you can sort them in O(n) time by doing an inorder traversal. If you could build a BST from a heap in O(n) time, you could then have an O(n) sorting algorithm by Building the heap in O(n) time, Converting the heap to a BST in O(n) time, and

This question already has an answer here: What's the difference between set<pair> and map in C++? 7 answers I'm relatively new to c++ programming and was wondering if someone could help clarify a few questions for me. http://www.cplusplus.com/reference/set/set/ http://www.cplusplus.com/reference/map/map/ I've been reading on how to implement STL binary search trees and I keep noticing that std::set and std::map are constantly mentioned as the methods for accomplishing such a task. What exactly is the difference between the two however? To me both seem almost identical and I'm not sure if there

I want to "paint" the tree on screen using CSS and HTML and not represent it in any way or data structure ... A very simple way of creating a tree-like structure with HTML and CSS is nesting <div> s Each div represents a node, and can have multiple nodes inside: <div> //root <div> //child 1 <div> //child 1.1 <div></div> //child 1.1.1 <div></div> //child 1.1.2 <div></div> //child 1.1.3 </div> <div></div> //child 1.2 </div> <div></div> //child 2 </div> Then you can add a margin-top to all divs, so that they appear under its parent div. A JSFiddle: http://jsfiddle.net/VxRmc/ I've added percentage

I have got a question, and it says "calculate the tight time complexity for the process of inserting n numbers into a binary search tree". It does not denote whether this is a balanced tree or not. So, what answer can be given to such a question? If this is a balanced tree, then height is logn, and inserting n numbers take O(nlogn) time. But this is unbalanced, it may take even O(n 2 ) time in the worst case. What does it mean to find the tight time complexity of inserting n numbers to a bst? Am i missing something? Thanks It could be O(n^2) even if the tree is balanced. Suppose you're adding

I have been given two binary search trees. For example, A and B. Next, I was asked to delete the tree B from the tree A. By deletion, I mean delete all the nodes present in B from A. Note: B is not necessarily a subtree of A. eg: A: 50 / \ 10 75 / / \ 1 60 90 B: 10 / \ 1 75 Resulting tree should be: 50 \ 60 \ 90 Two approaches came to my mind: A1: node* deleteTree(node* A, node* B) ; Take the root of tree B. Delete this node from tree A(by normal BSt deletion method). Next divide the problem into two parts - for the left subtree of B and the right subtree of B. For each of the subtree, recurse

Are there any self-balancing binary search tree ( RED-BLACK , AVL or others) built-in types in Python 2.7 or Python 3.x? I am looking for something equivalent to Java's TreeMap or TreeSet . If there are no such built-ins, why have they been ommited? Is there a special reason, for not including such tools? There's no special reason, to my knowledge - I'd guess that the reason is that for so many applications the highly-tuned dict and set implementations (which are hash tables) work well. They're good enough in most cases. There are definitely situations where you need the performance