IDEA-311645 Replaced ArrayDeque with LinkedLIst

Despite ArrayDeque claims to work faster than LinkedList, it consumes memory even when it's empty. Especially when we have a lot of Nodes expanded.
This change should not noticeably reduce performance, but should reduce a memory footprint.

GitOrigin-RevId: 252eb18dc96466eaa9fb34bb7f655f1a42a449cd

platform/platform-impl/src/com/intellij/ui/tree/AsyncTreeModel.java

@@ -693,7 +693,7 @@ public final class AsyncTreeModel extends AbstractTreeModel implements Searchabl
   }
 
   private static final class CommandQueue<T extends Command> {
-    private final Deque<T> deque = new ArrayDeque<>();
+    private final LinkedList<T> deque = new LinkedList<>();
     private volatile boolean closed;
 
     T get() {