Encyclopedia.com > Dictionaries, Thesauruses, Pictures, and Press Releases > A Dictionary of Computing > January 2004

binary-tree representation

A Dictionary of Computing | 2004 | 326 words | Copyright

binary-tree representation
1. A binary tree constructed to represent a tree of arbitrary degree. For any node, the root of the left subtree in the binary-tree representation is the eldest child of the node in the original tree and the root of the right subtree is the next eldest sibling (see diagram).

2. See binary tree (2).

Cite this article
Pick a style below, and copy the text for your bibliography.

  • MLA
  • Chicago
  • APA

JOHN DAINTITH. "binary-tree representation." A Dictionary of Computing. 2004. Encyclopedia.com. 27 May. 2012 <http://www.encyclopedia.com>.

JOHN DAINTITH. "binary-tree representation." A Dictionary of Computing. 2004. Encyclopedia.com. (May 27, 2012). http://www.encyclopedia.com/doc/1O11-binarytreerepresentation.html

JOHN DAINTITH. "binary-tree representation." A Dictionary of Computing. 2004. Retrieved May 27, 2012 from Encyclopedia.com: http://www.encyclopedia.com/doc/1O11-binarytreerepresentation.html

Learn more about citation styles

Find thousands of answers for hundreds of subjects at Answers Encyclopedia .

All answers verified by trusted sources at Encyclopedia.com

Try Answers Encyclopedia now!

For students and teachers!

Encyclopedia.com provides students and teachers facts, information, and biographies from verified, citable sources, including:

Encyclopedia.com provides students and teachers facts, information, and biographies from verified, citable sources, including: