I\'m trying to decide which data structure 开发者_C百科to use for the following. Lets say I have maybe 10 million keys that contain pointers to unique objects containing some data.
Two BSTs (Binary Search Trees) are given. How to find largest common sub-tree in the given two binary trees?
I am trying to write a code that searches a binary tree for an element and then adds starting at that element. So far I can find the correct position and add to that position, but I lose the rest of t
Thought I\'d use an Anderson tree for something.So I started porting to C++ the Julienne Walker version found here: http://www.eternallyconfuzzled.com/tuts/datastructures/jsw_tut_andersson.aspx
If this is a Complete Binary Tree, why the following is not? 开发者_如何转开发See Wikipedia: Types of binary trees
I found this interview question in Java, and I think the output is right to left order un开发者_开发百科der number 3, means:
So I\'ve tried one method that locks each node as it looks at it, but this requires ALOT of locking and unlocking... which of course requires quite a bit of overhead.I was wondering if anyone knew of
I want to print out into my sorted tree on which level this number was and that must be a recursion function.
Can someone tell me what the following lines do else if ( obj < retrieve() ) { return ( left() == 0 ) ? 0 : left()->erase( obj, left_tree );
I would like to print the keys of B+ Tree the way it actually looks in C .For example in the following form
加载中,请稍侯......