Abstract: Technologies are generally provided for converting a k-ary tree to an equivalent height balanced binary tree. A k-ary tree root may be first set as the binary tree root. Nodes may then be inserted in the binary tree based on nodes of the k-ary tree. First two children of each k-ary tree node may be inserted as left and right children in the binary tree. If there are additional children, those may be inserted into a child queue. If there are less than two children in the k-ary tree, children from the child queue may be used to fill the left and right child nodes in the equivalent binary tree repeating the process level-wise until all nodes in the k-ary tree are processed.

Abstract: Technologies are generally provided for converting a k-ary tree to an equivalent height balanced binary tree. A k-ary tree root may be first set as the binary tree root. Nodes may then be inserted in the binary tree based on nodes of the k-ary tree. First two children of each k-ary tree node may be inserted as left and right children in the binary tree. If there are additional children, those may be inserted into a child queue. If there are less than two children in the k-ary tree, children from the child queue may be used to fill the left and right child nodes in the equivalent binary tree repeating the process level-wise until all nodes in the k-ary tree are processed.