tag

#bst

2 pages tagged

Wiki › Algorithms › 02. Data Structures › 1. Core Data Structures and Operations ›

1.7 Binary Search Trees

1.7 Binary search trees, 45 index slug name 1 binary-search-tree Binary Search Tree 2 bst-insert BST Insert 3 bst-delete BST Delete 4 bst-search BST Search 5 bst-minimum Minimum 6 bst-maximum Maximum 7 bst-predecessor Predecessor 8 bst-successor Successor 9 bst-height Height 10 bst-depth Depth 11 bst-traversal-inorder Inorder Traversal 12 bst-traversal-preorder Preorder Traversal 13 bst-traversal-postorder Postorder Traversal 14 bst-level-order Level Order 15 bst-iterative-traversal Iterative Traversal 16 bst-recursive-traversal Recursive Traversal 17 bst-balance-check Balance...

Wiki › Algorithms › 01. Searching and Sorting › 4. Tree and Indexed Search ›

BST Search

Binary Search Tree Search Binary Search Tree (BST) search locates a key by following the tree structure and using the ordering invariant: all keys in the left subtree are smaller all keys in the right subtree are larger This property allows you to discard half of the remaining subtree at each step, similar in spirit to binary search on arrays. Problem Given a binary search tree with root node root...