Binary Trees/Inorder: Difference between revisions
From charlesreid1
(Created page with "=Binary Trees - In-order Traversal= ==Basic idea== The basis of in-order traversal is that the binary tree be sorted. This implements the convention of a sorted binary tree,...") |
No edit summary |
||
| Line 8: | Line 8: | ||
The value of node k is less than every node in the right subtree of node k. (Right goes second. Left to right precedence.) | The value of node k is less than every node in the right subtree of node k. (Right goes second. Left to right precedence.) | ||
=Flags= | |||
{{TreesFlag}} | |||
{{AlgorithmsFlag}} | |||
[[Category:Trees]] | |||
[[Category:Traversal]] | |||
[[Category:Binary Trees]] | |||
[[Category:Recursion]] | |||
Revision as of 19:35, 11 June 2017
Binary Trees - In-order Traversal
Basic idea
The basis of in-order traversal is that the binary tree be sorted. This implements the convention of a sorted binary tree, a recursive definition:
The value of node k is greater than every node in the left subtree of node k. (Left goes first. Left to right precedence.)
The value of node k is less than every node in the right subtree of node k. (Right goes second. Left to right precedence.)
Flags
 |
Trees Part of Computer Science Notes
Series on Data Structures Abstract data type: Trees/ADT Concrete implementations: Trees/LinkedTree · Trees/ArrayTree · SimpleTree
Tree Traversal Preorder traversal: Trees/Preorder Postorder traversal: Trees/Postorder In-Order traversal: Binary Trees/Inorder Breadth-First Search: BFS Breadth-First Traversal: BFT Depth-First Search: DFS Depth-First Traversal: DFT OOP Principles for Traversal: Tree Traversal/OOP · Tree Traversal/Traversal Method Template Tree operations: Trees/Operations Performance · Trees/Removal
Tree Applications Finding Minimum in Log N Time: Tree/LogN Min Search
Abstract data type: Binary Trees/ADT Concrete implementations: Binary Trees/LinkedBinTree · Binary Trees/ArrayBinTree Binary Trees/Cheat Sheet · Binary Trees/OOP · Binary Trees/Implementation Notes
|
|
Algorithms Part of Computer Science Notes
Series on Algorithms
Algorithms/Sort · Algorithmic Analysis of Sort Functions · Divide and Conquer · Divide and Conquer/Master Theorem Three solid O(n log n) search algorithms: Merge Sort · Heap Sort · Quick Sort Algorithm Analysis/Merge Sort · Algorithm Analysis/Randomized Quick Sort
Algorithms/Search · Binary Search · Binary Search Modifications
Algorithms/Combinatorics · Algorithms/Combinatorics and Heuristics · Algorithms/Optimization · Divide and Conquer
Algorithms/Strings · Algorithm Analysis/Substring Pattern Matching
Algorithm complexity · Theta vs Big O Amortization · Amortization/Aggregate Method · Amortization/Accounting Method Algorithm Analysis/Matrix Multiplication
Estimation Estimation · Estimation/BitsAndBytes
Algorithm Practice and Writeups Project Euler · Five Letter Words · Letter Coverage
|