Merging Height Biased Leftist Trees
Merging two nodes together depends on whether the tree is a min or max height biased leftist tree. For a min height biased leftist tree, set the higher valued node as its right child of the lower valued node. If the lower valued node already has a right child, then merge the higher valued node with the sub-tree rooted by the right child of the lower valued node.
After merging, the s-value of the lower valued node must be updated (see above section, s-value). Now check if the lower valued node has a left child. If it does not, then move the right child to the left. If it does have a left child, then the child with the highest s-value should go on the left.
Read more about this topic: Leftist Tree
Famous quotes containing the words merging, height, biased and/or trees:
“An administrator in a bureaucratic world is a man who can feel big by merging his non-entity in an abstraction. A real person in touch with real things inspires terror in him.”
—Marshall McLuhan (1911–1980)
“Alas! if the principles of contentment are not within us,—the height of station and worldly grandeur will as soon add a cubit to a man’s stature as to his happiness.”
—Laurence Sterne (1713–1768)
“Scientists are human—they’re as biased as any other group. But they do have one great advantage in that science is a self-correcting process.”
—Cyril Ponnamperuma (b. 1923)
“Why are there trees I never walk under but large and melodious thoughts descend upon me?”
—Walt Whitman (1819–1892)