# CISC 2200 Chapter Notes - Chapter 15: Binary Search Tree, Tree Traversal, Binary Tree

42 views2 pages

## Document Summary

The height of trees: height of a tree is # of nodes on longest path from root to a leaf. The maximum and minimum heights of a binary tree: maximum height of a binary tree is # of nodes in binary tree, minimum height of a binary tree is log2(# of nodes + 1) Traversals of a binary tree: traversal algorithm for binary tree visits each node in tree, preorder traversal traverses root node then both of root node"s subtrees. Inorder traversal traverses root node after traversing root subtree"s left subtree, but before traversing right subtree: postorder traversal traverses root node after traversing both subtrees of the root node. The adt binary search tree: binary search tree is binary tree whose data is organized by value. Creating a binary search tree: search algorithm used to determine insertion points when creating binary search tree.

## Get access

\$40 USD/m
Billed monthly
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class