Part 1 – height As starblue says, height is just recursive. In pseudo-code: height(node) = max(height(node.L), height(node.R)) + 1 Now height could be defined in two ways. It could be the number of nodes in the path from the root to that node, or it could be the number of links. According to the page … Read more
Sean’s post (the currently accepted one) contains several incorrect claims. Sorry Sean, I don’t mean to be rude; I hope I can convince you that my statement is based in fact. They’re totally different in their use cases, so it’s not possible to make a comparison. They’re both used for maintaining a set of totally … Read more
Here’s the version with one stack and without a visited flag: private void postorder(Node head) { if (head == null) { return; } LinkedList<Node> stack = new LinkedList<Node>(); stack.push(head); while (!stack.isEmpty()) { Node next = stack.peek(); boolean finishedSubtrees = (next.right == head || next.left == head); boolean isLeaf = (next.left == null && next.right == … Read more
The standard trade offs between these data structures apply. Binary Trees medium complexity to implement (assuming you can’t get them from a library) inserts are O(logN) lookups are O(logN) Linked lists (unsorted) low complexity to implement inserts are O(1) lookups are O(N) Hash tables high complexity to implement inserts are O(1) on average lookups are … Read more
In C++17, the new map::extract function lets you change the key. Example: std::map<int, std::string> m{ {10, “potato”}, {1, “banana”} }; auto nodeHandler = m.extract(10); nodeHandler.key() = 2; m.insert(std::move(nodeHandler)); // { { 1, “banana” }, { 2, “potato” } }
Check out Printing Binary Trees in Ascii From @AnyOneElse Pastbin below: !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! !!!Code originally from /http://www.openasthra.com/c-tidbits/printing-binary-trees-in-ascii/ !!! Just saved it, cause the website is down. !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! Printing Binary Trees in Ascii Here we are not going to discuss what binary trees are (please refer this, if you are looking for binary search trees), or their … Read more
I think the SortedSet<T> class in System.Collections.Generic is what you’re looking for. From this CodeProject article: It is implemented using a self-balancing red-black tree that gives a performance complexity of O(log n) for insert, delete, and lookup. It is used to keep the elements in sorted order, to get the subset of elements in a … Read more
Total no of Binary Trees are = Summing over i gives the total number of binary search trees with n nodes. The base case is t(0) = 1 and t(1) = 1, i.e. there is one empty BST and there is one BST with one node. So, In general you can compute total no of … Read more
Perfect Tree: x / \ / \ x x / \ / \ x x x x / \ / \ / \ / \ x x x x x x x x Complete Tree: x / \ / \ x x / \ / \ x x x x / \ / x x … Read more
Once expressed in big-O() notation, both are correct. However, during the derivation of the O() polynomial, in the case of binary search, only log2 is correct. I assume this distinction was the intuitive inspiration for your question to begin with. Also, as a matter of my opinion, writing O(log2 N) is better for your example, … Read more