Day 568 - Teaching Kids Programming - Min Difference Between BST Nodes (Recursive DFS In-Order)

00:01 What is a Binary Search Tree?
01:00 Minimum Difference/Distance Between Any Two Different Nodes in BST
02:16 Inorder Traversal on BST
03:30 Check only Neighbour Two Numbers to Get the Min Difference
04:08 Recursion DFS In order Traversal
04:20 yield from (using generator)
07:03 Degraded BST
08:10 Record Previous Node in BST
08:20 Recursive DFS In-order without storing the nodes in the list
12:00 What have you learnt? (Summary)

Post: https://helloacm.com/teaching-kids-programming-minimum-distance-between-bst-nodes-recursive-depth-first-search-in-order-traversal-algorithm/

If you like this video and would like to encourage and support me, maybe you can buy me a coffee, thanks! https://www.buymeacoffee.com/y0BtG5R

Please Like, Comment, Share, and Subscribe!

**List of All Programming Tutorial Videos**
https://zhihua-lai.com/teaching/

教媳妇小白和娃编程: https://zhihua-lai.com/teaching/ch/

----
#recursion #binarysearchtree #inorder
#programming #algorithms #python #pythonforkids #pythontutorial #coding #teachingkids #coding #teachingkidsprogramming

Видео Day 568 - Teaching Kids Programming - Min Difference Between BST Nodes (Recursive DFS In-Order) канала Doctor Lai