In this paper we have developed an algorithm that converts a given k-ary tree, for any k ≥ 3, to its equivalent binary tree structure. The binary tree is generated in O(n) time, for a k-ary tree with a total of n nodes. The algorithm is designed aiming at reducing the height of the constructed binary tree. The constructed tree does not contain any free links in the non-leaf nodes. That means th...

In 1985, Sleator and Tarjan introduced the splay tree, a self-adjusting binary search tree algorithm. Splay trees were conjectured to perform within a constant factor as any offline rotation-based search tree algorithm on every sufficiently long sequence—any binary search tree algorithm that has this property is said to be dynamically optimal. However, currently neither splay trees nor any othe...

Aiming at the problems of the slow convergence speed of general partial binary tree support vector machine (SVM) classifier and the fault samples easy to accumulate caused by complete binary tree and partial binary tree SVM classifier. The thesis proposes a multi-category classification method based on the unbalanced binary tree support vector machine (SVM),which construct a unbalanced binary t...