Please enable JavaScript.
Coggle requires JavaScript to display documents.
MM7 - Coggle Diagram
MM7
Tree
members
Ancestor
parent
leaf
Ordered Trees
a rooted tree in which all the children of each
vertex are ordered
binary search trees.
log2 n ≤ h ≤ n − 1.
Searching and insertion
connected acyclic graph
A graph that has no cycles but is not necessarily connected is called a forest
|E|=|V | − 1.
Rooted Trees
Binary Tree Traversals and Related Properties
divide-and-conqueror in binary trees
subtree
external and internal
by visiting the tree’s root and its left and
right subtrees.
preorder traversal
indorder traversal
postorder traversal
A(n(T )) = A(n(Tlef t)) + A(n(Tr ight)) + 1 for n(T ) > 0,