<commit_before>/*
 * Problem description:      Given a singly linked list where elements are sorted in ascending order, convert 
 *                           it to a height balanced BST.
 * Solution time complexity: O(n log n)
 * Comments:                 Given solution is non-destructive to the list it's called on.
 */

/**
 * Definition of ListNode
 * class ListNode {
 * public:<commit_msg>Update solution.cpp<commit_after>/*
 * Problem description:      Given a singly linked list where elements are sorted in ascending order, convert 
 *                           it to a height balanced BST.
 * Solution time complexity: O(n log n)
 * Comments:                 Given solution is non-destructive to the list it's called upon.
 */

/**
 * Definition of ListNode
 * class ListNode {
 * public:
{'fraction_non_alphanumeric': 0.07393483709273183, 'fraction_numerical': 0.0, 'mean_word_length': 2.371308016877637, 'pattern_counts': {'":': 0, '<': 3, '<?xml version=': 0, '>': 3, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '1892962', 'n_tokens_mistral': 202, 'n_tokens_neox': 193, 'n_words': 90}