Binary Tree

Definition - What does Binary Tree mean?

A binary tree is a tree data structure where each node has up to two child nodes, creating the branches of the tree. The two children are usually called the left and right nodes. Parent nodes are nodes with children, while child nodes may include references to their parents.

Techopedia explains Binary Tree

A binary tree is made up of at most two nodes, often called the left and right nodes, and a data element. The topmost node of the tree is called the root node, and the left and right pointers direct to smaller subtrees on either side.

Binary trees are used to implement binary search trees and binary heaps. They are also often used for sorting data as in a heap sort.

Posted by:

Connect with us

Techopedia on Linkedin
Techopedia on Linkedin
Tweat cdn.techopedia.com
Techopedia on Twitter


'@Techopedia'
Sign up for Techopedia's Free Newsletter!
Techwise Webinar Series
The Cloud Imperative - What, Why, When, And How
The Cloud Imperative - What, Why, When, And How:
Join veteran analysts Dr. Robin Bloor of The Bloor Group, and Mark Madsen of Third Nature, as they explain how today’s cutting edge Cloud solutions can deliver enterprise caliber software like never before.

Email Newsletter

Join 138,000+ IT pros on our weekly newsletter

Resources
Free Whitepaper – Bridging the IT Operations Application Owner Gap
Free Whitepaper – Bridging the IT Operations Application Owner Gap:
Conflicting organizational needs all too often create tension between functional silos. Application owners demand more and more resources.
Free 30 Day Trial – VMTurbo Operations Manager
Free 30 Day Trial – VMTurbo Operations Manager:
VMTurbo's flagship product, Operations Manager maintains your virtual and cloud environments in a healthy state. It manages homogeneous and...