Back to Search
Start Over
Binary Tree.
- Source :
- Network Dictionary; 2007, p66-66, 1/9p
- Publication Year :
- 2007
-
Abstract
- A definition of the term "Binary Tree" is presented. It refers to a tree data structure in which each node has at most two children, which are called a left pointer and a right pointer. The root pointer points to the topmost node in the tree, while the left and right pointers point to smaller subtrees. Binary trees can be used as binary search trees and binary heaps.
- Subjects :
- DEFINITIONS
COMPUTER software
DATA structures
ELECTRONIC file management
Subjects
Details
- Language :
- English
- ISBNs :
- 9781602670006
- Database :
- Supplemental Index
- Journal :
- Network Dictionary
- Publication Type :
- Book
- Accession number :
- 31664204