Binary Search Tree: root remains null during Inorder (C++)

Question

So I\'m a little new to Binary search trees and I\'m trying to make a binary tree where each node is a vector of strings. then each insertion takes a string and only considers t