Introduction of BST A binary search tree (BST) is defined as follows.
The left subtree of a node contains only nodes with keys less than the node’s key. The right subtree of a node contains only nodes with keys greater than the node’s key. Both the left and right subtrees must also be binary search trees. Inorder traversal Recursively traverse the current node’s left subtree. Visit the current node (in the figure: position green).
Introduction A monotonic stack is a stack that keeps its elements in a certain order. For example, an increasing monotonic stack is [x1, x2, …, xn] where x1 <= x2 <= … xn. This means that each element is equal to or larger than the previous one. Monotonic stacks are useful for some problems, e.g. where you need to find the next greater number for each number in an array. For such problems, the key words to look for are next (prev) greater (lesser).
Book Info Title: Designing Machine Learning Systems
Author: Chip Huyen
Publisher: O’Reilly
This is a reading note for this book.
Chapter 1. Overview Of Machine Learning Systems Outline When to use machine learning Understanding machine learning systems Research vs production ML system vs traditional software system Recall What are the different components of ML systems? What does MLOps mean? What does a machine learning solution do? What’s the difference between a traditional algorithm and an ML algorithm?