binary-tree

问题 It seems to me that the only advantage of heap over binary tree is to find the smallest item in the heap in complexity of O(1) instead of O(log(2)n) in binary tree. When implementing priority queue you need to delete the smallest item each from the data structre. deleting the smallest item from a tree and both heap done in complexity of O(log(2)n). Althogh deleting item from a tree may be more complex. Deleting item with no childrens acctually very simple. My question is why use heap instead

问题 Tried exploring a lot over the net, but could get any help, Everywhere its like adding a node to the Binary Search tree. Question: Requesting for algorithm and code snippet for adding a node to the Binary tree . ( or point me to correct URL ) Assumption: As per my understanding, Binary Tree and Binary Search Tree is different? Correct me if I am wrong. ( request: if you are writing your code snippet please use proper variable name, that helps in understanding ) Eg: Binary Tree 5 7 3 x1 x2 x3

问题 I'm trying to insert a Binary Node. My code is convoluted and there's no hope of rescuing it so I plan to rewrite it (basically I didn't account for backtracking and didn't think about the algorithm all that closely). I'm trying to insert a Binary Node using in order traversal, but I don't understand how I'm supposed to backtrack. D / \ B E / \ / \ A C F How would I search through the left subtree of root D and then go back and search through the right one? It might be a stupid question, but

问题 Often we need trees in algorithms and I get out a tree with lots of pointers and recursion. Sometimes I need more speed an I put the tree into an 2D array like so: Example of a binary tree stored in an array +-----------------+ |0eeeeeeeeeeeeeeee| //no pointers needed, parent/child, is y dimension, |11 dddddddd| //sibbling is x dimension of the array. |2222 cccc| //The 123 tree is stored root up. |33333333 bb| //Notice how the abc-tree is stored upside down |4444444444444444a| //The wasted

问题 This is a popular interview question and the only article I can find on the topic is one from TopCoder. Unfortunately for me, it looks overly complicated from an interview answer's perspective. Isn't there a simpler way of doing this other than plotting the path to both nodes and deducing the ancestor? (This is a popular answer, but there's a variation of the interview question asking for a constant space answer). 回答1: Constant space answer: (although not necessarily efficient). Have a

问题 This is a popular interview question and the only article I can find on the topic is one from TopCoder. Unfortunately for me, it looks overly complicated from an interview answer's perspective. Isn't there a simpler way of doing this other than plotting the path to both nodes and deducing the ancestor? (This is a popular answer, but there's a variation of the interview question asking for a constant space answer). 回答1: Constant space answer: (although not necessarily efficient). Have a

问题 I'm wondering whether anyone here has ever used a skip list. It looks to have roughly the same advantages as a balanced binary tree but is simpler to implement. If you have, did you write your own, or use a pre-written library (and if so, what was its name)? 回答1: Years ago I implemented my own for a probabilistic algorithms class. I'm not aware of any library implementations, but it's been a long time. It is pretty simple to implement. As I recall they had some really nice properties for

问题 I have simple binary search tree public class BNode { public int item; public BNode right; public BNode left; public BNode(int item) { this.item = item; } } public class BTree { private BNode _root; private int _count; private IComparer<int> _comparer = Comparer<int>.Default; public BTree() { _root = null; _count = 0; } public bool Add(int Item) { if (_root == null) { _root = new BNode(Item); _count++; return true; } else { return Add_Sub(_root, Item); } } private bool Add_Sub(BNode Node, int

问题 I have written the following code to check if a tree is a Binary search tree. Please help me check the code: Okay! The code is edited now. This simple solution was suggested by someone in the posts below: IsValidBST(root,-infinity,infinity); bool IsValidBST(BinaryNode node, int MIN, int MAX) { if(node == null) return true; if(node.element > MIN && node.element < MAX && IsValidBST(node.left,MIN,node.element) && IsValidBST(node.right,node.element,MAX)) return true; else return false; } 回答1: A

问题 public void HeightIterative() { int counter = 0; int counter2 = 0; TreeNode current=root; if(current != null) { while(current.LeftNode!=null) { counter++; current = current.LeftNode; } while(current.RightNode!=null) { counter2++; current = current.RightNode; } } int res = 1+Math.Max(counter, counter2); Console.WriteLine("The Height Of Tree Is: "+res); } I wrote iterative method, to calculate height of tree. but in some cases its not working properly. As in case: 10 1 2 3 4 5 18 17 16 15 14 13