Live briefing
Everything about Binary expression tree
Binary tree representing a mathematical expression
A binary expression tree is a specific kind of a binary tree used to represent expressions. Two common types of expressions that a binary expression tree can represent are algebraic and boolean. These trees can represent expressions that contain both unary and binary operators. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Binary expression treeA 5-minute orientation
- Pick up a classic book: Java software solutionsThe most-reprinted book on the subject
- Read the landmark paper: Graphical Expression for Logical Model of Geologic Structure by Binary TreeCited 2 times
- Go sideways: Tree contractionA closely related topic
- Go sideways: Parent pointer treeA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
Java software solutionsLewis, John, John E. Lewis Ph. D. · 1997
Learning PythonMark Lutz, David Ascher · 1999
Starting out with C++Tony Gaddis · 2000
Mathematical structures for computer scienceJudith L. Gersting · 1982
Bioinformatics Research and ApplicationsZhipeng Cai · 2013
Introduction to automata theory, languages, and computationJohn E. Hopcroft, Jeffrey D. Ullman · 1979
An introduction to computer scienceJean-Paul Tremblay, Richard B. Bunt · 1979
Automate the Boring Stuff with PythonAl Sweigart · 2015
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Tree contraction In computer science, parallel tree contraction is a broadly applicable technique for the parallel solution of a large number of tree problems, and is used…
- Parent pointer tree In computer science, an in-tree or parent pointer tree is an N-ary tree data structure in which each node has a pointer to its parent node, but no pointers…
- Binary decision diagram In computer science, a binary decision diagram (BDD) or branching program is a data structure that is used to represent a Boolean function. On a more abstract…
- SECD machine The SECD machine is an influential virtual machine and abstract machine intended as a target for compilers of functional programming languages. The letters…
- Shunting yard algorithm In computer science, the shunting yard algorithm is a method for parsing arithmetical or logical expressions, or a combination of both, specified in infix…
- Truth function In logic, a truth function is a function that accepts truth values as input and produces a unique truth value as output. In other words: the input and…
- Expression (mathematics) In mathematics, an expression is an arrangement of symbols following the context-dependent, syntactic conventions of mathematical notation. Symbols can…
- Recursion (computer science) In computer science, recursion is a method of solving a computational problem where the solution depends on solutions to smaller instances of the same…