liveBook · Manning

Search tree

A search tree is a tree-structured representation of states, decisions, keys, or alternatives that supports systematic exploration or retrieval.

How 2 Manning books explain it

Applied Reinforcement Learning

A search tree is a branching data structure whose nodes represent states or decision points and whose edges represent possible actions or outcomes.

How it is used
Simulates possible action sequences to guide strategic what-if analysis and constrained vehicle-routing decisions.
How deep it goes
Defines state and action branches, then works through partial-tree MCTS selection, expansion, simulation, and reward updates instead of exhaustive route search.
Examples
Uses logistics-network expansion scenarios and capacitated vehicle routing with customer assignments, vehicle limits, and route distances.
What you can do after
Evaluate simulated decisions before committing and understand how MCTS concentrates search on promising routing solutions.

Read how Applied Reinforcement Learning explains search tree →

Grokking Bayes

A search tree is a tree representation of possible decisions, subsequent actions, outcomes, and utilities in a decision process.

How it is used
Frames decisions under uncertainty by connecting available actions to probabilistic outcomes and utilities.
How deep it goes
Explains node roles, expected-utility traversal, sequential branching, and continuous outcomes, but stops short of implementation code.
Examples
Uses website launch choices, alternative government policies, utility tables, and one-step or two-step decision figures.
What you can do after
Evaluate actions by traversing outcome branches, weighting utilities by probabilities, and comparing expected utilities.

Read how Grokking Bayes explains search tree →

What to know first

Related concepts

Questions about search tree

What is search tree?

A search tree is a tree-structured representation of states, decisions, keys, or alternatives that supports systematic exploration or retrieval.

Which Manning books explain search tree?

Applied Reinforcement Learning and Grokking Bayes.

What should I know before learning search tree?

Manning books that teach search tree usually introduce Markov decision process first.

What kinds of search tree are there?

Kinds of search tree include binary search tree.

What is search tree a kind of?

Search tree is a kind of tree. A tree is a connected, acyclic structure of nodes organized through parent-child relationships, typically around a single root.

What are the parts of search tree?

Search tree includes decision node and leaf node.

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.