mirror of
https://github.com/krahets/hello-algo.git
synced 2026-08-24 00:57:14 +00:00
Translate all code to English (#1836)
* Review the EN heading format. * Fix pythontutor headings. * Fix pythontutor headings. * bug fixes * Fix headings in **/summary.md * Revisit the CN-to-EN translation for Python code using Claude-4.5 * Revisit the CN-to-EN translation for Java code using Claude-4.5 * Revisit the CN-to-EN translation for Cpp code using Claude-4.5. * Fix the dictionary. * Fix cpp code translation for the multipart strings. * Translate Go code to English. * Update workflows to test EN code. * Add EN translation for C. * Add EN translation for CSharp. * Add EN translation for Swift. * Trigger the CI check. * Revert. * Update en/hash_map.md * Add the EN version of Dart code. * Add the EN version of Kotlin code. * Add missing code files. * Add the EN version of JavaScript code. * Add the EN version of TypeScript code. * Fix the workflows. * Add the EN version of Ruby code. * Add the EN version of Rust code. * Update the CI check for the English version code. * Update Python CI check. * Fix cmakelists for en/C code. * Fix Ruby comments
This commit is contained in:
Yudong Jin
@@ -0,0 +1,152 @@
|
||||
/**
|
||||
* File: array_binary_tree.dart
|
||||
* Created Time: 2023-08-15
|
||||
* Author: liuyuxin (gvenusleo@gmail.com)
|
||||
*/
|
||||
|
||||
import '../utils/print_util.dart';
|
||||
import '../utils/tree_node.dart';
|
||||
|
||||
/* Binary tree class represented by array */
|
||||
class ArrayBinaryTree {
|
||||
late List<int?> _tree;
|
||||
|
||||
/* Constructor */
|
||||
ArrayBinaryTree(this._tree);
|
||||
|
||||
/* List capacity */
|
||||
int size() {
|
||||
return _tree.length;
|
||||
}
|
||||
|
||||
/* Get value of node at index i */
|
||||
int? val(int i) {
|
||||
// If index out of bounds, return null to represent empty position
|
||||
if (i < 0 || i >= size()) {
|
||||
return null;
|
||||
}
|
||||
return _tree[i];
|
||||
}
|
||||
|
||||
/* Get index of left child node of node at index i */
|
||||
int? left(int i) {
|
||||
return 2 * i + 1;
|
||||
}
|
||||
|
||||
/* Get index of right child node of node at index i */
|
||||
int? right(int i) {
|
||||
return 2 * i + 2;
|
||||
}
|
||||
|
||||
/* Get index of parent node of node at index i */
|
||||
int? parent(int i) {
|
||||
return (i - 1) ~/ 2;
|
||||
}
|
||||
|
||||
/* Level-order traversal */
|
||||
List<int> levelOrder() {
|
||||
List<int> res = [];
|
||||
for (int i = 0; i < size(); i++) {
|
||||
if (val(i) != null) {
|
||||
res.add(val(i)!);
|
||||
}
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
/* Depth-first traversal */
|
||||
void dfs(int i, String order, List<int?> res) {
|
||||
// If empty position, return
|
||||
if (val(i) == null) {
|
||||
return;
|
||||
}
|
||||
// Preorder traversal
|
||||
if (order == 'pre') {
|
||||
res.add(val(i));
|
||||
}
|
||||
dfs(left(i)!, order, res);
|
||||
// Inorder traversal
|
||||
if (order == 'in') {
|
||||
res.add(val(i));
|
||||
}
|
||||
dfs(right(i)!, order, res);
|
||||
// Postorder traversal
|
||||
if (order == 'post') {
|
||||
res.add(val(i));
|
||||
}
|
||||
}
|
||||
|
||||
/* Preorder traversal */
|
||||
List<int?> preOrder() {
|
||||
List<int?> res = [];
|
||||
dfs(0, 'pre', res);
|
||||
return res;
|
||||
}
|
||||
|
||||
/* Inorder traversal */
|
||||
List<int?> inOrder() {
|
||||
List<int?> res = [];
|
||||
dfs(0, 'in', res);
|
||||
return res;
|
||||
}
|
||||
|
||||
/* Postorder traversal */
|
||||
List<int?> postOrder() {
|
||||
List<int?> res = [];
|
||||
dfs(0, 'post', res);
|
||||
return res;
|
||||
}
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
void main() {
|
||||
// Initialize binary tree
|
||||
// Here we use a function to generate a binary tree directly from an array
|
||||
List<int?> arr = [
|
||||
1,
|
||||
2,
|
||||
3,
|
||||
4,
|
||||
null,
|
||||
6,
|
||||
7,
|
||||
8,
|
||||
9,
|
||||
null,
|
||||
null,
|
||||
12,
|
||||
null,
|
||||
null,
|
||||
15
|
||||
];
|
||||
|
||||
TreeNode? root = listToTree(arr);
|
||||
print("\nInitialize binary tree\n");
|
||||
print("Array representation of binary tree:");
|
||||
print(arr);
|
||||
print("Linked list representation of binary tree:");
|
||||
printTree(root);
|
||||
|
||||
// Binary tree class represented by array
|
||||
ArrayBinaryTree abt = ArrayBinaryTree(arr);
|
||||
|
||||
// Access node
|
||||
int i = 1;
|
||||
int? l = abt.left(i);
|
||||
int? r = abt.right(i);
|
||||
int? p = abt.parent(i);
|
||||
print("\nCurrent node index is $i, value is ${abt.val(i)}");
|
||||
print("Its left child index is $l, value is ${(l == null ? "null" : abt.val(l))}");
|
||||
print("Its right child index is $r, value is ${(r == null ? "null" : abt.val(r))}");
|
||||
print("Its parent node index is $p, value is ${(p == null ? "null" : abt.val(p))}");
|
||||
|
||||
// Traverse tree
|
||||
List<int?> res = abt.levelOrder();
|
||||
print("\nLevel-order traversal is: $res");
|
||||
res = abt.preOrder();
|
||||
print("Pre-order traversal is $res");
|
||||
res = abt.inOrder();
|
||||
print("In-order traversal is $res");
|
||||
res = abt.postOrder();
|
||||
print("Post-order traversal is $res");
|
||||
}
|
||||
@@ -0,0 +1,218 @@
|
||||
/**
|
||||
* File: avl_tree.dart
|
||||
* Created Time: 2023-04-04
|
||||
* Author: liuyuxin (gvenusleo@gmail.com)
|
||||
*/
|
||||
|
||||
import 'dart:math';
|
||||
import '../utils/print_util.dart';
|
||||
import '../utils/tree_node.dart';
|
||||
|
||||
class AVLTree {
|
||||
TreeNode? root;
|
||||
|
||||
/* Constructor */
|
||||
AVLTree() {
|
||||
root = null;
|
||||
}
|
||||
|
||||
/* Get node height */
|
||||
int height(TreeNode? node) {
|
||||
// Empty node height is -1, leaf node height is 0
|
||||
return node == null ? -1 : node.height;
|
||||
}
|
||||
|
||||
/* Update node height */
|
||||
void updateHeight(TreeNode? node) {
|
||||
// Node height equals the height of the tallest subtree + 1
|
||||
node!.height = max(height(node.left), height(node.right)) + 1;
|
||||
}
|
||||
|
||||
/* Get balance factor */
|
||||
int balanceFactor(TreeNode? node) {
|
||||
// Empty node balance factor is 0
|
||||
if (node == null) return 0;
|
||||
// Node balance factor = left subtree height - right subtree height
|
||||
return height(node.left) - height(node.right);
|
||||
}
|
||||
|
||||
/* Right rotation operation */
|
||||
TreeNode? rightRotate(TreeNode? node) {
|
||||
TreeNode? child = node!.left;
|
||||
TreeNode? grandChild = child!.right;
|
||||
// Using child as pivot, rotate node to the right
|
||||
child.right = node;
|
||||
node.left = grandChild;
|
||||
// Update node height
|
||||
updateHeight(node);
|
||||
updateHeight(child);
|
||||
// Return root node of subtree after rotation
|
||||
return child;
|
||||
}
|
||||
|
||||
/* Left rotation operation */
|
||||
TreeNode? leftRotate(TreeNode? node) {
|
||||
TreeNode? child = node!.right;
|
||||
TreeNode? grandChild = child!.left;
|
||||
// Using child as pivot, rotate node to the left
|
||||
child.left = node;
|
||||
node.right = grandChild;
|
||||
// Update node height
|
||||
updateHeight(node);
|
||||
updateHeight(child);
|
||||
// Return root node of subtree after rotation
|
||||
return child;
|
||||
}
|
||||
|
||||
/* Perform rotation operation to restore balance to this subtree */
|
||||
TreeNode? rotate(TreeNode? node) {
|
||||
// Get balance factor of node
|
||||
int factor = balanceFactor(node);
|
||||
// Left-leaning tree
|
||||
if (factor > 1) {
|
||||
if (balanceFactor(node!.left) >= 0) {
|
||||
// Right rotation
|
||||
return rightRotate(node);
|
||||
} else {
|
||||
// First left rotation then right rotation
|
||||
node.left = leftRotate(node.left);
|
||||
return rightRotate(node);
|
||||
}
|
||||
}
|
||||
// Right-leaning tree
|
||||
if (factor < -1) {
|
||||
if (balanceFactor(node!.right) <= 0) {
|
||||
// Left rotation
|
||||
return leftRotate(node);
|
||||
} else {
|
||||
// First right rotation then left rotation
|
||||
node.right = rightRotate(node.right);
|
||||
return leftRotate(node);
|
||||
}
|
||||
}
|
||||
// Balanced tree, no rotation needed, return directly
|
||||
return node;
|
||||
}
|
||||
|
||||
/* Insert node */
|
||||
void insert(int val) {
|
||||
root = insertHelper(root, val);
|
||||
}
|
||||
|
||||
/* Recursively insert node (helper method) */
|
||||
TreeNode? insertHelper(TreeNode? node, int val) {
|
||||
if (node == null) return TreeNode(val);
|
||||
/* 1. Find insertion position and insert node */
|
||||
if (val < node.val)
|
||||
node.left = insertHelper(node.left, val);
|
||||
else if (val > node.val)
|
||||
node.right = insertHelper(node.right, val);
|
||||
else
|
||||
return node; // Duplicate node not inserted, return directly
|
||||
updateHeight(node); // Update node height
|
||||
/* 2. Perform rotation operation to restore balance to this subtree */
|
||||
node = rotate(node);
|
||||
// Return root node of subtree
|
||||
return node;
|
||||
}
|
||||
|
||||
/* Remove node */
|
||||
void remove(int val) {
|
||||
root = removeHelper(root, val);
|
||||
}
|
||||
|
||||
/* Recursively delete node (helper method) */
|
||||
TreeNode? removeHelper(TreeNode? node, int val) {
|
||||
if (node == null) return null;
|
||||
/* 1. Find node and delete */
|
||||
if (val < node.val)
|
||||
node.left = removeHelper(node.left, val);
|
||||
else if (val > node.val)
|
||||
node.right = removeHelper(node.right, val);
|
||||
else {
|
||||
if (node.left == null || node.right == null) {
|
||||
TreeNode? child = node.left ?? node.right;
|
||||
// Number of child nodes = 0, delete node directly and return
|
||||
if (child == null)
|
||||
return null;
|
||||
// Number of child nodes = 1, delete node directly
|
||||
else
|
||||
node = child;
|
||||
} else {
|
||||
// Number of child nodes = 2, delete the next node in inorder traversal and replace current node with it
|
||||
TreeNode? temp = node.right;
|
||||
while (temp!.left != null) {
|
||||
temp = temp.left;
|
||||
}
|
||||
node.right = removeHelper(node.right, temp.val);
|
||||
node.val = temp.val;
|
||||
}
|
||||
}
|
||||
updateHeight(node); // Update node height
|
||||
/* 2. Perform rotation operation to restore balance to this subtree */
|
||||
node = rotate(node);
|
||||
// Return root node of subtree
|
||||
return node;
|
||||
}
|
||||
|
||||
/* Search node */
|
||||
TreeNode? search(int val) {
|
||||
TreeNode? cur = root;
|
||||
// Loop search, exit after passing leaf node
|
||||
while (cur != null) {
|
||||
// Target node is in cur's right subtree
|
||||
if (val < cur.val)
|
||||
cur = cur.left;
|
||||
// Target node is in cur's left subtree
|
||||
else if (val > cur.val)
|
||||
cur = cur.right;
|
||||
// Target node equals current node
|
||||
else
|
||||
break;
|
||||
}
|
||||
return cur;
|
||||
}
|
||||
}
|
||||
|
||||
void testInsert(AVLTree tree, int val) {
|
||||
tree.insert(val);
|
||||
print("\nAfter inserting node $val, AVL tree is");
|
||||
printTree(tree.root);
|
||||
}
|
||||
|
||||
void testRemove(AVLTree tree, int val) {
|
||||
tree.remove(val);
|
||||
print("\nAfter deleting node $val, AVL tree is");
|
||||
printTree(tree.root);
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
void main() {
|
||||
/* Please pay attention to how the AVL tree maintains balance after inserting nodes */
|
||||
AVLTree avlTree = AVLTree();
|
||||
/* Insert node */
|
||||
// Delete nodes
|
||||
testInsert(avlTree, 1);
|
||||
testInsert(avlTree, 2);
|
||||
testInsert(avlTree, 3);
|
||||
testInsert(avlTree, 4);
|
||||
testInsert(avlTree, 5);
|
||||
testInsert(avlTree, 8);
|
||||
testInsert(avlTree, 7);
|
||||
testInsert(avlTree, 9);
|
||||
testInsert(avlTree, 10);
|
||||
testInsert(avlTree, 6);
|
||||
|
||||
/* Please pay attention to how the AVL tree maintains balance after deleting nodes */
|
||||
testInsert(avlTree, 7);
|
||||
|
||||
/* Remove node */
|
||||
// Delete node with degree 1
|
||||
testRemove(avlTree, 8); // Delete node with degree 2
|
||||
testRemove(avlTree, 5); // Remove node with degree 1
|
||||
testRemove(avlTree, 4); // Remove node with degree 2
|
||||
|
||||
/* Search node */
|
||||
TreeNode? node = avlTree.search(7);
|
||||
print("\nFound node object is $node, node value = ${node!.val}");
|
||||
}
|
||||
@@ -0,0 +1,153 @@
|
||||
/**
|
||||
* File: binary_search_tree.dart
|
||||
* Created Time: 2023-04-04
|
||||
* Author: liuyuxin (gvenusleo@gmail.com)
|
||||
*/
|
||||
|
||||
import '../utils/print_util.dart';
|
||||
import '../utils/tree_node.dart';
|
||||
|
||||
/* Binary search tree */
|
||||
class BinarySearchTree {
|
||||
late TreeNode? _root;
|
||||
|
||||
/* Constructor */
|
||||
BinarySearchTree() {
|
||||
// Initialize empty tree
|
||||
_root = null;
|
||||
}
|
||||
|
||||
/* Get root node of binary tree */
|
||||
TreeNode? getRoot() {
|
||||
return _root;
|
||||
}
|
||||
|
||||
/* Search node */
|
||||
TreeNode? search(int _num) {
|
||||
TreeNode? cur = _root;
|
||||
// Loop search, exit after passing leaf node
|
||||
while (cur != null) {
|
||||
// Target node is in cur's right subtree
|
||||
if (cur.val < _num)
|
||||
cur = cur.right;
|
||||
// Target node is in cur's left subtree
|
||||
else if (cur.val > _num)
|
||||
cur = cur.left;
|
||||
// Found target node, exit loop
|
||||
else
|
||||
break;
|
||||
}
|
||||
// Return target node
|
||||
return cur;
|
||||
}
|
||||
|
||||
/* Insert node */
|
||||
void insert(int _num) {
|
||||
// If tree is empty, initialize root node
|
||||
if (_root == null) {
|
||||
_root = TreeNode(_num);
|
||||
return;
|
||||
}
|
||||
TreeNode? cur = _root;
|
||||
TreeNode? pre = null;
|
||||
// Loop search, exit after passing leaf node
|
||||
while (cur != null) {
|
||||
// Found duplicate node, return directly
|
||||
if (cur.val == _num) return;
|
||||
pre = cur;
|
||||
// Insertion position is in cur's right subtree
|
||||
if (cur.val < _num)
|
||||
cur = cur.right;
|
||||
// Insertion position is in cur's left subtree
|
||||
else
|
||||
cur = cur.left;
|
||||
}
|
||||
// Insert node
|
||||
TreeNode? node = TreeNode(_num);
|
||||
if (pre!.val < _num)
|
||||
pre.right = node;
|
||||
else
|
||||
pre.left = node;
|
||||
}
|
||||
|
||||
/* Remove node */
|
||||
void remove(int _num) {
|
||||
// If tree is empty, return directly
|
||||
if (_root == null) return;
|
||||
TreeNode? cur = _root;
|
||||
TreeNode? pre = null;
|
||||
// Loop search, exit after passing leaf node
|
||||
while (cur != null) {
|
||||
// Found node to delete, exit loop
|
||||
if (cur.val == _num) break;
|
||||
pre = cur;
|
||||
// Node to delete is in cur's right subtree
|
||||
if (cur.val < _num)
|
||||
cur = cur.right;
|
||||
// Node to delete is in cur's left subtree
|
||||
else
|
||||
cur = cur.left;
|
||||
}
|
||||
// If no node to delete, return directly
|
||||
if (cur == null) return;
|
||||
// Number of child nodes = 0 or 1
|
||||
if (cur.left == null || cur.right == null) {
|
||||
// When number of child nodes = 0 / 1, child = null / that child node
|
||||
TreeNode? child = cur.left ?? cur.right;
|
||||
// Delete node cur
|
||||
if (cur != _root) {
|
||||
if (pre!.left == cur)
|
||||
pre.left = child;
|
||||
else
|
||||
pre.right = child;
|
||||
} else {
|
||||
// If deleted node is root node, reassign root node
|
||||
_root = child;
|
||||
}
|
||||
} else {
|
||||
// Number of child nodes = 2
|
||||
// Get next node of cur in inorder traversal
|
||||
TreeNode? tmp = cur.right;
|
||||
while (tmp!.left != null) {
|
||||
tmp = tmp.left;
|
||||
}
|
||||
// Recursively delete node tmp
|
||||
remove(tmp.val);
|
||||
// Replace cur with tmp
|
||||
cur.val = tmp.val;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
void main() {
|
||||
/* Initialize binary search tree */
|
||||
BinarySearchTree bst = BinarySearchTree();
|
||||
// Please note that different insertion orders will generate different binary trees, this sequence can generate a perfect binary tree
|
||||
List<int> nums = [8, 4, 12, 2, 6, 10, 14, 1, 3, 5, 7, 9, 11, 13, 15];
|
||||
for (int _num in nums) {
|
||||
bst.insert(_num);
|
||||
}
|
||||
print("\nInitialized binary tree is\n");
|
||||
printTree(bst.getRoot());
|
||||
|
||||
/* Search node */
|
||||
TreeNode? node = bst.search(7);
|
||||
print("\nFound node object is $node, node value = ${node?.val}");
|
||||
|
||||
/* Insert node */
|
||||
bst.insert(16);
|
||||
print("\nAfter inserting node 16, binary tree is\n");
|
||||
printTree(bst.getRoot());
|
||||
|
||||
/* Remove node */
|
||||
bst.remove(1);
|
||||
print("\nAfter removing node 1, binary tree is\n");
|
||||
printTree(bst.getRoot());
|
||||
bst.remove(2);
|
||||
print("\nAfter removing node 2, binary tree is\n");
|
||||
printTree(bst.getRoot());
|
||||
bst.remove(4);
|
||||
print("\nAfter removing node 4, binary tree is\n");
|
||||
printTree(bst.getRoot());
|
||||
}
|
||||
@@ -0,0 +1,37 @@
|
||||
/**
|
||||
* File: binary_tree.dart
|
||||
* Created Time: 2023-04-03
|
||||
* Author: liuyuxin (gvenusleo@gmail.com)
|
||||
*/
|
||||
|
||||
import '../utils/print_util.dart';
|
||||
import '../utils/tree_node.dart';
|
||||
|
||||
void main() {
|
||||
/* Initialize binary tree */
|
||||
// Initialize node
|
||||
TreeNode n1 = TreeNode(1);
|
||||
TreeNode n2 = TreeNode(2);
|
||||
TreeNode n3 = TreeNode(3);
|
||||
TreeNode n4 = TreeNode(4);
|
||||
TreeNode n5 = TreeNode(5);
|
||||
// Build references (pointers) between nodes
|
||||
n1.left = n2;
|
||||
n1.right = n3;
|
||||
n2.left = n4;
|
||||
n2.right = n5;
|
||||
print("\nInitialize binary tree\n");
|
||||
printTree(n1);
|
||||
|
||||
/* Insert node P between n1 -> n2 */
|
||||
TreeNode p = TreeNode(0);
|
||||
// Insert node p between n1 -> n2
|
||||
n1.left = p;
|
||||
p.left = n2;
|
||||
print("\nAfter inserting node P\n");
|
||||
printTree(n1);
|
||||
// Remove node P
|
||||
n1.left = n2;
|
||||
print("\nAfter removing node P\n");
|
||||
printTree(n1);
|
||||
}
|
||||
@@ -0,0 +1,38 @@
|
||||
/**
|
||||
* File: binary_tree_bfs.dart
|
||||
* Created Time: 2023-04-03
|
||||
* Author: liuyuxin (gvenusleo@gmai.com)
|
||||
*/
|
||||
|
||||
import 'dart:collection';
|
||||
import '../utils/print_util.dart';
|
||||
import '../utils/tree_node.dart';
|
||||
|
||||
/* Level-order traversal */
|
||||
List<int> levelOrder(TreeNode? root) {
|
||||
// Initialize queue, add root node
|
||||
Queue<TreeNode?> queue = Queue();
|
||||
queue.add(root);
|
||||
// Initialize a list to save the traversal sequence
|
||||
List<int> res = [];
|
||||
while (queue.isNotEmpty) {
|
||||
TreeNode? node = queue.removeFirst(); // Dequeue
|
||||
res.add(node!.val); // Save node value
|
||||
if (node.left != null) queue.add(node.left); // Left child node enqueue
|
||||
if (node.right != null) queue.add(node.right); // Right child node enqueue
|
||||
}
|
||||
return res;
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
void main() {
|
||||
/* Initialize binary tree */
|
||||
// Here we use a function to generate a binary tree directly from an array
|
||||
TreeNode? root = listToTree([1, 2, 3, 4, 5, 6, 7]);
|
||||
print("\nInitialize binary tree\n");
|
||||
printTree(root);
|
||||
|
||||
// Level-order traversal
|
||||
List<int> res = levelOrder(root);
|
||||
print("\nLevel-order traversal node print sequence = $res");
|
||||
}
|
||||
@@ -0,0 +1,62 @@
|
||||
/**
|
||||
* File: binary_tree_dfs.dart
|
||||
* Created Time: 2023-04-04
|
||||
* Author: liuyuxin (gvenusleo@gmail.com)
|
||||
*/
|
||||
|
||||
import '../utils/print_util.dart';
|
||||
import '../utils/tree_node.dart';
|
||||
|
||||
// Initialize list for storing traversal sequence
|
||||
List<int> list = [];
|
||||
|
||||
/* Preorder traversal */
|
||||
void preOrder(TreeNode? node) {
|
||||
if (node == null) return;
|
||||
// Visit priority: root node -> left subtree -> right subtree
|
||||
list.add(node.val);
|
||||
preOrder(node.left);
|
||||
preOrder(node.right);
|
||||
}
|
||||
|
||||
/* Inorder traversal */
|
||||
void inOrder(TreeNode? node) {
|
||||
if (node == null) return;
|
||||
// Visit priority: left subtree -> root node -> right subtree
|
||||
inOrder(node.left);
|
||||
list.add(node.val);
|
||||
inOrder(node.right);
|
||||
}
|
||||
|
||||
/* Postorder traversal */
|
||||
void postOrder(TreeNode? node) {
|
||||
if (node == null) return;
|
||||
// Visit priority: left subtree -> right subtree -> root node
|
||||
postOrder(node.left);
|
||||
postOrder(node.right);
|
||||
list.add(node.val);
|
||||
}
|
||||
|
||||
/* Driver Code */
|
||||
void main() {
|
||||
/* Initialize binary tree */
|
||||
// Here we use a function to generate a binary tree directly from an array
|
||||
TreeNode? root = listToTree([1, 2, 3, 4, 5, 6, 7]);
|
||||
print("\nInitialize binary tree\n");
|
||||
printTree(root);
|
||||
|
||||
/* Preorder traversal */
|
||||
list.clear();
|
||||
preOrder(root);
|
||||
print("\nPre-order traversal node print sequence = $list");
|
||||
|
||||
/* Inorder traversal */
|
||||
list.clear();
|
||||
inOrder(root);
|
||||
print("\nIn-order traversal node print sequence = $list");
|
||||
|
||||
/* Postorder traversal */
|
||||
list.clear();
|
||||
postOrder(root);
|
||||
print("\nPost-order traversal node print sequence = $list");
|
||||
}
|
||||
Reference in New Issue
Block a user