链式二叉树的前序创建、递归遍历、利用堆栈的非递归遍历、前序销毁以及求二叉树的深度

Pre-order creation of chained binary trees, recursive traversal, non-recursive traversal using stacks, pre-order destruction, and depth of binary trees