$7\mathrm{.}13$ LAB: BST validity checker

Step $1$: Inspect the

Node.py file

mapect the class beclatation for a Bsr hode is Node py Access. Node py by clacking on the orange antow hext to man py at the fog of the

coding wirdow. Each bode tas a kep, a liet chid reference and aright child reference.

Step $2$: Implement the check bst$\_$validity$0$ function

A violiting hode wil be one of three ening:

A node is the leht putbere of an ancenot with a lesser bey

A nooy in the right tubtree of an anchetor with a geaser hey

A noch wish the $10$ft or pight artreute referencing an

ancester