Binary Search Trees: Difference between revisions
Jump to navigation
Jump to search
(Created page with "=Internal= * Tree Concepts =Overview= A binary search tree is a binary tree that has the Binary Search Tree...") |
|||
| Line 3: | Line 3: | ||
=Overview= | =Overview= | ||
A binary search tree is a [[Tree_Concepts#Binary_Tree|binary tree]] that has the Binary Search Tree Property. | A binary search tree is a [[Tree_Concepts#Binary_Tree|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: {{Internal|Tree_Representation_in_Memory#Binary_Trees|Binary Tree Representation in Memory}} | ||
Revision as of 03:49, 13 October 2021
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: