All Questions
3 questions
0
votes
1
answer
49
views
Is binary tree balanced if and only if the morris traversal of the tree produces ordered list?
I'm trying to check if the binary tree is binary search tree. My idea is to use Morris traversal. Intuitively a binary tree is balanced iff Morris traversal produces a sorted threaded linked list.
The ...
- 105
3
votes
1
answer
327
views
finding an algorithm for creating a priority search tree in linear time with presorting
A priority search tree is a binary tree satisfying the following:
every node $u$ stores a point $p_u = (x_u,y_u)$
every nonleaf $u$ stores an x-coordinate $x_u'$ called the split-line coordinate.
If $...
- 207
0
votes
1
answer
366
views
Merging two binary search tress
You have two binary search trees A and B, each one is a complete binary tree containing $2^k-1$
nodes. The maximum value of the keys in the tree A is less than the minimum value of the keys
in tree B. ...
