  We explore new connections between complete non-ambiguous trees (CNATs) and
permutations. We give a bijection between tree-like tableaux and a specific
subset of CNATs. This map is used to establish and solve a recurrence relation
for the number of tree-like tableaux of a fixed size without occupied corners,
proving a conjecture by Laborde-Zubieta. We end by establishing a row/column
swapping operation on CNATs and identify new areas for future research.
