Bifalgorithm post · Brisk · Chapter 1

Why is this not a binary search tree?

Why is this not a binary search tree? (Brisk · Chapter 1) — "No. Although nearly every node does satisfy the BST property (all the nodes in its left subtree co…

Ideas in this flowchart

  • The BST property has a single exception involving Zoe and Wash.
  • Nearly every node satisfies the BST property.
  • Nodes in a node’s left subtree come before it alphabetically.
  • Nodes in a node’s right subtree come after it alphabetically.
  • Zoe is the single exception to this property.
  • Zoe is currently in Wash’s left subtree.
  • Zoe should be in Wash’s right subtree.
Bifalgorithm
Sign up
Feed/

Why is this not a binary search tree?

Channel

Brisk

1 page

U
USR292600b83e2a
Ebook3w

"No. Although nearly every node does satisfy the BST property (all the nodes in its left subtree come before it alphabetically, and all the nodes in its right subtree come after it), there is a single exception: Zoe is in Wash ’s left subtree, whereas she should be to his right."

Flowchart preview
Series cover
👍
0
0 comments0 shares

Sign in to view and post comments.