Vulkan

摘要： //Given a sorted (increasing order) array, write an algorithm to create a binary tree with minimal height.//// 译文：//// 给定一个有序数组(递增)，写程序构建一棵具有最小高度的二叉树。... 阅读全文

摘要： X 阅读全文

摘要： //Implement a function to check if a tree is balanced. For the purposes of this question, a balanced tree is defined to be a tree such that no two lea... 阅读全文

摘要： #include #include using namespace std;class tree{public: tree() { //root = create(); root = NULL; } /***输入扩展层次遍历序列，#表示该节点为空***/ tree(char *s) { roo... 阅读全文