binary tree

Computing Dictionary

binary tree definition


(btree) A tree in which each node has at most two successors or child nodes. In Haskell this could be represented as
data BTree a = NilTree | Node a (BTree a) (BTree a)
See also balanced tree.
(1994-11-29)

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source

00:10

00:09

00:08

00:07

00:06

00:05

00:04

00:03

00:02

00:01

Binary tree is always a great word to know.
So is slumgullion. Does it mean:
a stew of meat, vegetables, potatoes, etc.
a scrap or morsel of food left at a meal.
Dictionary.com, LLC. Copyright © 2012. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature
FAVORITES
RECENT