Binary tree: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

9 November 2023

  • curprev 04:5104:51, 9 November 2023‎ Ai talk contribs‎ 4,015 bytes +4,015‎ Created page with "== Definition == A binary tree is a type of data structure that has at most two children for each parent node. The children are usually distinguished as "left" and "right". Nodes with children are parent nodes, or simply parents. While binary trees are used in many areas of computer science, they are most commonly used to implement binary search trees and binary heaps. == Properties == Binary trees have several properties that are useful in algorithms..."
Retrieved from "https://canonica.ai/page/Binary_tree"