package com.leetcode102;
import java.util.List;
public class Main {
public static void main(String[] args) {
Integer[] arr = {3, 9, 20, null, null, 15, 7};
TreeNode tree = createTree(arr, 0);
printPreOrder(tree);
System.out.println();
printMidOrder(tree);
System.out.println();
printAfterOrder(tree);
System.out.println();
}
/**
* 前序遍历
*/
public static void printPreOrder(TreeNode tree) {
if (tree != null) {
System.out.print(tree.val == null ? "" : tree.val + " ");
printPreOrder(tree.left);
printPreOrder(tree.right);
}
}
/**
* 中序遍历
*/
public static void printMidOrder(TreeNode tree) {
if (tree != null) {
printMidOrder(tree.left);
System.out.print(tree.val == null ? "" : tree.val + " ");
printMidOrder(tree.right);
}
}
/**
* 后序遍历
*/
public static void printAfterOrder(TreeNode tree) {
if (tree != null) {
printAfterOrder(tree.left);
printAfterOrder(tree.right);
System.out.print(tree.val == null ? "" : tree.val + " ");
}
}
/**
* 创建一个二叉树
* ----3
* -9 20
* -----15 17
*/
public static TreeNode createTree(Integer[] arr, int index) {
TreeNode root = null;
if (index < arr.length) {
root = new TreeNode(arr[index]);
root.left = createTree(arr, 2 * index + 1);
root.right = createTree(arr, 2 * index + 2);
}
return root;
}
}
class TreeNode {
Integer val;
TreeNode left;
TreeNode right;
TreeNode() {
}
TreeNode(Integer val) {
this.val = val;
}
TreeNode(int val, TreeNode left, TreeNode right) {
this.val = val;
this.left = left;
this.right = right;
}
}
leetcode二叉树相关模板
Pastthewind2023-10-27 8:43
相关推荐
Highcharts.js6 小时前
Highcharts漏斗图表使用配置指南凌冰_10 小时前
数据结构 - 时间空间复杂度(一)武昌库里写JAVA10 小时前
SpringBoot+Vue 项目介绍Pniubi10 小时前
力扣2 . 两数相加戴·菲瑜10 小时前
为什么PPO难以做出顶级棋类引擎学长毕设11 小时前
基于SpringBoot的儿童慈善捐赠管理系统-附源码慧一居士11 小时前
@RestControllerAdvice 的注解作用和使用学长毕设12 小时前
基于SpringBoot非遗文化展示与传播平台设计与实现-附源码在所不辞兄13 小时前
为什么数字孪生驱动的产线标定需要在线更新机制,而不能一次标定后长期沿用?金銀銅鐵14 小时前
用 Swing 重做操作数栈演示