斑马网络面试题整理

2401_86367086

于 2024-09-08 17:29:16 发布

阅读量271

点赞数 1

文章标签： java 开发语言

本文链接：https://blog.csdn.net/2401_86367086/article/details/142030022

版权

    TreeNode rightNode;

    public TreeNode(int data, TreeNode leftNode, TreeNode rightNode) {
        this.data = data;
        this.leftNode = leftNode;
        this.rightNode = rightNode;
    }

    public TreeNode(int data) {
        this.data = data;
    }

    public int getData() {
        return data;
    }

    public void setData(int data) {
        this.data = data;
    }

    public TreeNode getLeftNode() {
        return leftNode;
    }

    public void setLeftNode(TreeNode leftNode) {
        this.leftNode = leftNode;
    }

    public TreeNode getRightNode() {
        return rightNode;
    }

    public void setRightNode(TreeNode rightNode) {
        this.rightNode = rightNode;
    }
}

//先序遍历——递归方法
public static void preOrder(TreeNode root) {
    if (root != null) {
        System.out.print(root.data + "\t");
        preOrder(root.leftNode);
        preOrder(root.rightNode);
    }
}

//先序遍历——非递归方法
public static void preOrderNonRecursive(TreeNode root) {
    //栈——先入后出
    Stack<TreeNode> stack = new Stack<>();
    while (true) {
        while (root != null) {
            System.out.print(root.data + "\t");
            stack.push(root);
            root = root.getLeftNode();
        }
        if (stack.isEmpty()) break;
        root = stack.pop();
        root = root.getRightNode();
    }
}

//中序遍历
public static void inOrder(TreeNode root) {
    if (root != null) {
        inOrder(root.leftNode);
        System.out.print(root.data + "\t");
        inOrder(root.rightNode);
    }
}

//后序遍历
public static void postOrder(TreeNode root) {
    if (root != null) {
        inOrder(root.leftNode);
        inOrder(root.rightNode);
        System.out.print(root.data + "\t");
    }
}

//中序遍历——非递归方法
public static void inOrderNonRecursive(TreeNode root) {
    Stack<TreeNode> stack = new Stack<>();
    while (true) {
        while (root != null) {
            stack.push(root);
            root = root.getLeftNode();
        }
        if (stack.isEmpty()) break;
        root = stack.pop();
        System.out.print(root.data + "\t");
        root = root.getRightNode();
    }
}

//层序遍历（逐层打印）：层序遍历用到了队列，而先、中、后序需要用到栈。
public static void levelOrder(TreeNode root) {
    TreeNode temp;
    Queue<TreeNode> queue = new LinkedList<>();
    //offer方法和add方法都是往队列尾部插入元素，但当超出队列界限时，offer方法返回false，add方法抛异常
    queue.offer(root);
    while (!queue.isEmpty()) {
        temp = queue.poll();
        System.out.print(temp.data + "\t");
        if (temp.getLeftNode() != null) {
            queue.offer(temp.getLeftNode());
        }
        if (temp.getRightNode() != null) {
            queue.offer(temp.getRightNode());
        }
    }
}

public static void main(String[] args) {
    TreeNode root = new TreeNode(57);
    root.leftNode = new TreeNode(48);
    root.leftNode.leftNode = new TreeNode(34);
    root.leftNode.rightNode = new TreeNode(49);
    root.rightNode = new TreeNode(77);
    //先序遍历
    System.out.println("先序遍历：");
    preOrder(root);
    System.out.println();
    //先序遍历——非递归
    preOrderNonRecursive(root);