Binary Search Trees

From NovaOrdis Knowledge Base
Revision as of 03:49, 13 October 2021 by Ovidiu (talk | contribs) (→‎Overview)
Jump to navigation Jump to search

Internal

Overview

A binary search tree is a binary tree that has the Binary Search Tree Property. A binary search tree is represented in memory using three pointers: left child, right child and the parent. More details on binary tree representation in memory are available here:

Binary Tree Representation in Memory
Retrieved from "https://kb.novaordis.com/index.php?title=Binary_Search_Trees&oldid=83603"