翻转python二叉树是怎样进行

 1class MyStack {
 2    private Queue que;
 3
 4    public MyStack() {
 5        que = new LinkedList<>();
 6    }
 7
 8    public void push(int x) {
 9        que.offer(x);
10        for (int i = 0; i < que.size() - 1; ++i) {
11            que.offer(que.poll());
12        }
13    }
14
15    public int pop() {
16        return que.poll();
17    }
18
19    public int top() {
20        return que.peek();
21    }
22
23    public boolean empty() {
24        return que.isEmpty();
25    }
26}