What is the page?

This is a page for Assignment 9: HTMLAndCSS for CS400.

What is a Binary Search Tree?

The binary search tree data structure is an expansion of the binary tree strucutre where data is contained within a node that has a maximum of 2 children nodes it connects to. In this specific structure, the current node's child on the left must be smaller in comparison to its data, and its child on the right must have larger data than its own.

Why are Binary Search Trees useful?

• Because of the relationship of parent and child, the search, insertion, and deletion are O(log n) in a balanced tree.
• They are the underlying strucutre for more in-depth data structures like AVL and Red-Black Trees.
• Recursion is quite simple while iterating through a tree, making operations like size simple without a stored variable

For more info, click here!