Description: Enhanced binary search tree is a generalization of a binary search tree, where each node except to save the keyword, but also save the node number points to the node is the root of the subtree (including the node itself). Achieve its create, copy, before/during/after preorder, statistics storey structure subordinate judges and other operations.
To Search:
File list (Check if you may need any files):
第4次编程作业-增强二叉搜索树.cpp
Download