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:
“You hear a lot of dialogue on the death of the American family. Families aren’t dying. They’re merging into big conglomerates.”
—Erma Bombeck (b. 1927)
“Much more frequent in Hollywood than the emergence of Cinderella is her sudden vanishing. At our party, even in those glowing days, the clock was always striking twelve for someone at the height of greatness; and there was never a prince to fetch her back to the happy scene.”
—Ben Hecht (1893–1964)
“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)
“The trees are coming into leaf
Like something almost being said....”
—Philip Larkin (1922–1986)