![]() |
![]() |
![]() |
![]() |
![]() | ![]() ![]() |
![]() |
![]() | ||||
![]() | ![]() | ![]() | ![]() |
Having built a binary tree in the memory of your computer, we need the algorithms to verify that the tree is indeed ordered. The recursive inorder algorithm is elegant, clean, but difficult to follow. You must understand this algorithm, for it provides a template for many binary tree routines. Once convinced that the tree is correct we will code a recursive search algorithm. The key topics for this lesson are:
|
![]() | ![]() | ![]() | ![]() | ||
![]() |
|
|
|