In this chapter we aim to assemble the main design pieces that can be delivered to the coding team for coding:


We will start with the concept design from the previous chapter as our starting point.

Here are the highlights of that design:

BST Object Diagram
The root designates the root node of the tree.

For the sortFct and searchFct, see sort and search functions
BST
  |
  +------- root ------- a BSTNode
  |
  +------- sortFct ------- a function used for inserting/sorting
  |
  +------- searchFct ------- a function used for searching
BSTNode Object Diagram
What would we fill "????" in with?
BSTNode
  |
  +------- data ------- type varies
  |
  +------- ???? ------- a ????
  |
  +------- ???? ------- a ????































Data Structures And Algorithms (DSA) (Chapter 703 - BST Design)










Chapter 703 - BST Design Starting Point

Index Video Intro Headers Normalizing Design Size Design Docs Refs

Chapter Top Search Site Contents