Search trees.
Try to adopt all four traversal algorithm procedures for any binary tree.
Write methods to count the number of nodes in a binary tree to count the number of leaves to count the number of right children to find the height of the tree to delete all leaves from a binary tree
Write a method that checks whether a binary tree.
Design an algorithm to test whether a binary tree.