题目: Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST. 代码: /** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {}…